论文信息 - Circumferences and minimum degrees in 3-connected claw-free graphs - 字舞流文

Circumferences and minimum degrees in 3-connected claw-free graphs

In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n,[email protected]}, thereby generalizing several known results.

Mingchu Li | Yuan Tian | Xu Yuan | He Jiang | Yongrui Cui | Liming Xiong

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

[2] Hong-Jian Lai,et al. Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs , 2003 .

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

[4] Hong-Jian Lai,et al. Hamiltonicity in 3-connected claw-free graphs , 2006, J. Comb. Theory, Ser. B.

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

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

[7] Odile Favaron,et al. Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs , 2001, J. Comb. Theory, Ser. B.

[8] Mingchu Li. Hamiltonian properties of claw-free graphs , 1998 .

[9] David P. Sumner,et al. Longest paths and cycles in K1, 3-free graphs , 1985, J. Graph Theory.

[10] Mingchu Li,et al. Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs , 2005, Electron. Notes Discret. Math..