Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
Under an Elsevier user license
open archive
Keywords
Claw-free graph
Hamiltonian cycle
Minimum degree condition
Ryjáček's closure concept
Catlin's reduction method
Cited by (0)
- 1
Research is supported by Butler University Academic Grant (2014).
- 2
Research is supported by the Natural Science Funds of China (No. 11431037) and by Specialized Research Fund for the Doctoral Program of Higher Education (No. 20131101110048).
© 2016 Elsevier Inc.