论文信息 - Hamiltonicity of 3-connected line graphs

Hamiltonicity of 3-connected line graphs

Abstract Thomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectured [H. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Combin. Theory Ser. B 96 (2006) 571–576] that every 3-connected, essentially 4-connected line graph is Hamiltonian. In this note, we first show that the conjecture posed by Lai et al. is not true and there is an infinite family of counterexamples; we show that 3-connected, essentially 4-connected line graph of a graph with at most 9 vertices of degree 3 is Hamiltonian; examples show that all conditions are sharp.

Hong-Jian Lai | Xiaofeng Guo | Liming Xiong | Weihua Yang

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] Bill Jackson,et al. A Note Concerning some Conjectures on Cyclically 4–Edge Connected 3–Regular Graphs , 1988 .

[3] Carsten Thomassen,et al. Reflections on graph theory , 1986, J. Graph Theory.

[4] Siming Zhan,et al. On hamiltonian line graphs and connectivity , 1991, Discret. Math..

[5] Paul A. Catlin,et al. A reduction method to find spanning Eulerian subgraphs , 1988, J. Graph Theory.

[6] Zdenek Ryjácek,et al. On factors of 4-connected claw-free graphs , 2001, J. Graph Theory.

[7] Hong-Jian Lai,et al. Graphs without spanning closed trails , 1996, Discret. Math..

[8] Zdenek Ryjácek. On a Closure Concept in Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.

[9] Petr Vrána,et al. Hamilton cycles in 5-connected line graphs , 2010, Eur. J. Comb..

[10] Hong-Jian Lai,et al. Every 3-connected, essentially 11-connected line graph is Hamiltonian , 2006, J. Comb. Theory, Ser. B.

[11] Zdeněk Ryjáčk. On a Closure Concept in Claw-Free Graphs , 1997 .