In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This result has been extended in several papers. In this note, we determine the minimum number of vertices in a connected k-regular graph that is not Hamiltonian, and we also solve the analogous problem for Hamiltonian paths. Further, we characterize the smallest connected k-regular graphs without a Hamiltonian cycle. Published by Elsevier B.V.
机构:
CNRS, F-91405 Orsay, France
Univ Paris 11, LRI, F-91405 Orsay, France
Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Peoples R ChinaNankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Li, Hao
Tian, Feng
论文数: 0引用数: 0
h-index: 0
机构:
Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R ChinaNankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Tian, Feng
Xu, Zhi Xia
论文数: 0引用数: 0
h-index: 0
机构:
Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
Nankai Univ, LPMC TJKLC, Tianjin 300071, Peoples R China
Tianjin Polytech Univ, Dept Math, Tianjin 300160, Peoples R ChinaNankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
机构:
Maoming Univ, Ctr Comp Network & Informat, Maoming 525000, Peoples R ChinaS China Univ Technol, Sch Software Engn, Guangzhou 510641, Peoples R China
Qin, Yong
Xiao, Wenjun
论文数: 0引用数: 0
h-index: 0
机构:
S China Univ Technol, Sch Software Engn, Guangzhou 510641, Peoples R ChinaS China Univ Technol, Sch Software Engn, Guangzhou 510641, Peoples R China
Xiao, Wenjun
Miklavic, Stefko
论文数: 0引用数: 0
h-index: 0
机构:
Univ Primorska, Primorska Inst Nat Sci & Technol, Koper 6000, SloveniaS China Univ Technol, Sch Software Engn, Guangzhou 510641, Peoples R China