论文信息 - Hourglasses and Hamilton cycles in 4-connected claw-free graphs

Hourglasses and Hamilton cycles in 4-connected claw-free graphs

We show that if G is a 4-connected claw-free graph in which every induced hourglass subgraph S contains two non-adjacent vertices with a common neighbor outside S, then G is hamiltonian. This extends the fact that 4-connected claw-free, hourglass-free graphs are hamiltonian, thus proving a broader special case of a conjecture by Matthews and Sumner. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 267–276, 2005

Z. Ryjáček | Liming Xiong | Mingchu Li | Tomás Kaiser

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

[2] Sukhamay Kundu,et al. Bounds on the number of disjoint spanning trees , 1974 .

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

[4] P. Paulraja,et al. Counterexample to a conjecture on Hamilton cycles , 1987, Discret. Math..

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

[6] Graph whose edges are in small cycles , 1991, Discret. Math..

[7] Paul A. Catlin,et al. Supereulerian graphs: A survey , 1992, J. Graph Theory.

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

[9] Zdenek Ryjácek,et al. Forbidden subgraphs, hamiltonicity and closure in claw-free graphs , 1999, Discret. Math..

[10] Matthias Kriesell,et al. On factors of 4-connected claw-free graphs , 2001 .