论文信息 - Tank-Ring Factors in Supereulerian Claw-Free Graphs

Tank-Ring Factors in Supereulerian Claw-Free Graphs

A graph G has a tank-ring factor F if F is a connected spanning subgraph with all vertices of degree 2 or 4 that consists of one cycle C and disjoint triangles attaching to exactly one vertex of C such that every component of G − C contains exactly two vertices. In this paper, we show the following results. (1) Every supereulerian claw-free graph G with 1-hourglass property contains a tank-ring factor. (2) Every supereulerian claw-free graph with 2-hourglass property is Hamiltonian.

Mingchu Li | He Jiang | Bing Liu | Haitze J. Broersma | Lifeng Yuan

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

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

[3] Z. Ryjáček,et al. Hourglasses and Hamilton cycles in 4-connected claw-free graphs , 2005 .

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

[5] Haitze J. Broersma,et al. Cycles through particular subgraphs of claw-free graphs , 1995, J. Graph Theory.

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

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

[8] Liming Xiong,et al. Connected even factors in claw-free graphs , 2008, Discret. Math..

[9] François Jaeger. A Note on Sub-Eulerian Graphs , 1979, J. Graph Theory.

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