Show
Sort by
-
On minimum leaf spanning trees and a criticality notion
-
- Journal Article
- A1
- open access
Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks
-
On the minimum leaf number of cubic graphs
-
Non-hamiltonian triangulations with distant separating triangles
-
- Journal Article
- A1
- open access
Every 4-connected graph with crossing number 2 is Hamiltonian
-
Hamiltonian properties of polyhedra with few 3-cuts : a survey