On hamiltonian claw-free graphs
Discrete Mathematics
Hamiltonian cycles in 3-connected claw-free graphs
Journal of Graph Theory
Graph Theory With Applications
Graph Theory With Applications
One sufficient condition and its applications for hamiltonian graph using its spanning subgraph
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Hamiltonian claw-free graphs involving minimum degrees
Discrete Applied Mathematics
Hi-index | 0.05 |
It is shown that every 3-connected claw-free graph having at most 6δ - 7 vertices is hamiltonian, where δ is the minimum degree.