论文信息 - A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs

A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs

Abstract.Thomassen proposed a well-known conjecture: every 4-connected line graph is hamiltonian. In this note, we show that Thomassen’s conjecture is equivalent to the statement that the shortness coefficient of the class of all 4-connected line graphs is one and the statement that the shortness coefficient of the class of all 4-connected claw-free graphs is one respectively.

Liming Xiong | Roman Kuzel

[1] Uppaluri S. R. Murty,et al. Graph Theory with Applications , 1978 .

[2] Hansjoachim Walther,et al. Shortness Exponents of Families of Graphs , 1973, J. Comb. Theory, Ser. A.

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

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

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

[6] Martin Kochol. Equivalence of Fleischner's and Thomassen's Conjectures , 2000, J. Comb. Theory, Ser. B.

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

[8] David P. Sumner,et al. Hamiltonian results in K1, 3-free graphs , 1984, J. Graph Theory.

[9] Terry A. McKee. Recharacterizing Eulerian: Intimations of new duality , 1984, Discret. Math..

[10] P. J. Owens,et al. Shortness parameters for polyhedral graphs , 1999, Discret. Math..

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

[12] L. Beineke. Characterizations of derived graphs , 1970 .

[13] F. Harary,et al. On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

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