Hamilton cycles in regular 2-connected graphs
Journal of Combinatorial Theory Series A
Updating the Hamiltonian problem—a survey
Journal of Graph Theory
On Hamiltonian line graphs and connectivity
Discrete Mathematics
Dominating cycles in regular 3-connected graphs
Discrete Mathematics
Hamilton cycles in regular 3-connected graphs
Discrete Mathematics
A generalization of Ore's theorem involving neighborhood unions
Discrete Mathematics
Cycles containing all vertices of maximum degree
Journal of Graph Theory
Toughness, minimum degree, and the existence of 2-factors
Journal of Graph Theory
On dominating and spanning circuits in graphs
Proceedings of the first Malta conference on Graphs and combinatorics
On Hamiltonian properties of 2-tough graphs
Journal of Graph Theory
Long cycles in graphs with prescribed toughness and minimum degree
Discrete Mathematics
Toughness, hamiltonicity and split graphs
Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Basic graph theory: paths and circuits
Handbook of combinatorics (vol. 1)
Hamiltonicity of regular 2-connected graphs
Journal of Graph Theory
Selected papers from the second Krakow conference on Graph theory
On a closure concept in claw-free graphs
Journal of Combinatorial Theory Series B
Not every 2-tough graph is Hamiltonian
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Chrodality and 2-factors in tough graphs
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Graph Theory With Applications
Graph Theory With Applications
Closure, 2-factors, and cycle coverings in claw-free graphs
Journal of Graph Theory
More than one tough chordal planar graphs are Hamiltonian
Journal of Graph Theory
On factors of 4-connected claw-free graphs
Journal of Graph Theory
| Hi-index | 0.05 |
We survey results and open problems in hamiltonian graph theory centered around three themes: regular graphs, t-tough graphs, and claw-free graphs.