论文信息 - 3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected

3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected

We investigate pairs of forbidden subgraphs that imply a 3-connected graph is Hamiltonian-connected. In particular we show that the pair {K1,3, P9} is such a pair. As it is known that P10 cannot replace P9, this result is best possible. Further, we show that certain other graphs are not possible.

[1] Stephan Brandt. 9-Connected Claw-Free Graphs Are Hamilton-Connected , 1999, J. Comb. Theory, Ser. B.

[2] G. Chartrand,et al. Graphs & Digraphs , 1986 .

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

[4] Ronald J. Gould,et al. Hamiltonian Connected Graphs Involving Forbidden Subgraphs , 2014 .

[5] F. Bruce Shepherd,et al. Hamiltonicity in claw-free graphs , 1990, J. Comb. Theory, Ser. B.

[6] Alexander K. Kelmans. On graph closures , 2003, Discret. Math..

[7] Ralph J. Faudree,et al. Characterizing forbidden pairs for hamiltonian properties , 1997, Discret. Math..

[8] Ralph J. Faudree,et al. Forbidden subgraphs that imply hamiltonian-connectedness , 2002, J. Graph Theory.

[9] Zdenek Ryjácek,et al. On Forbidden Pairs Implying Hamilton-Connectedness , 2013, J. Graph Theory.