TY - JOUR
T1 - Hamiltonian claw-free graphs involving induced cycles
AU - Yin, Jun
AU - Xiong, Liming
N1 - Publisher Copyright:
© Published under licence by IOP Publishing Ltd.
PY - 2020/10/13
Y1 - 2020/10/13
N2 - The hamiltonian problem is an important topic in structural graph theory, which is closely related to Four Color Problem. Hence lots of graph scholars are dedicated to this topic. There are many authors working for finding some sufficient conditions for hamiltonian property of graphs. Let G be a claw-free graph with n vertices and δ(G)≥3. In this paper, we show that if G has an induced cycle of length more than (4n - 2δ(G)-4)(δ(G)+2)-1, then G is hamiltonian. The result is best possible if δG is 3 or 4.
AB - The hamiltonian problem is an important topic in structural graph theory, which is closely related to Four Color Problem. Hence lots of graph scholars are dedicated to this topic. There are many authors working for finding some sufficient conditions for hamiltonian property of graphs. Let G be a claw-free graph with n vertices and δ(G)≥3. In this paper, we show that if G has an induced cycle of length more than (4n - 2δ(G)-4)(δ(G)+2)-1, then G is hamiltonian. The result is best possible if δG is 3 or 4.
UR - http://www.scopus.com/inward/record.url?scp=85096415814&partnerID=8YFLogxK
U2 - 10.1088/1742-6596/1634/1/012069
DO - 10.1088/1742-6596/1634/1/012069
M3 - Conference article
AN - SCOPUS:85096415814
SN - 1742-6588
VL - 1634
JO - Journal of Physics: Conference Series
JF - Journal of Physics: Conference Series
IS - 1
M1 - 012069
T2 - 2020 3rd International Conference on Computer Information Science and Application Technology, CISAT 2020
Y2 - 17 July 2020 through 19 July 2020
ER -