论文信息 - Every 3-connected, locally connected, claw-free graph is Hamilton-connected

Every 3-connected, locally connected, claw-free graph is Hamilton-connected

A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of order p 3, containing no induced subgraph isomorphic to K1;3, is Hamilton-connected if and only if G is 3-connected.

Armen S. Asratian

[1] David P. Sumner,et al. Every connected, locally connected nontrivial graph with no induced claw is hamiltonian , 1979, J. Graph Theory.

[2] Henk Jan Veldman,et al. 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian , 1987, J. Graph Theory.

[3] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[4] S. V. Kanetkar,et al. Connected, locally 2-connected, K1, 3-free graphs are panconnected , 1984, J. Graph Theory.

[5] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .

[6] Gary Chartrand,et al. A note on locally connected and hamiltonian-connected graphs , 1979 .