论文信息 - A NINE VERTEX THEOREM FOR 3-CONNECTED CLAW-FREE GRAPHS

A NINE VERTEX THEOREM FOR 3-CONNECTED CLAW-FREE GRAPHS

It is proved that if G is a 3-connected claw-free graph and if S is a set of vertices in G with j S j 5 9, then G contains a cycle which in turn contains S. This result is sharp.

Michael D. Plummer | Ervin Győri

[1] Katsuhiro Ota,et al. Cycles through prescribed vertices with large degree sum , 1995, Discret. Math..

[2] M. Watkins,et al. Cycles and Connectivity in Graphs , 1967, Canadian Journal of Mathematics.

[3] László Lovász,et al. Cycles through specified vertices of a graph , 1981, Comb..

[4] William T. Tutte,et al. A theory of 3-connected graphs , 1961 .

[5] Hazel Perfect,et al. Applications of Menger's graph theorem , 1968 .

[6] Brendan D. McKay,et al. Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs , 1999, Graphs Comb..

[7] G. Dirac. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen† , 1960 .

[8] Brendan D. McKay,et al. A nine point theorem for 3-connected graphs , 1982, Comb..

[9] Shi Ronghua,et al. 2-neighborhoods and Hamiltonian conditions , 1992 .

[10] Odile Favaron,et al. Sequences, claws and cyclability of graphs , 1996 .

[11] Hao Li,et al. Cyclability of 3-connected graphs , 2000 .