Premium
Every 3‐connected, locally connected, claw‐free graph is Hamilton‐connected
Author(s) -
Asratian A. S.
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199610)23:2<191::aid-jgt10>3.0.co;2-k
Subject(s) - combinatorics , mathematics , neighbourhood (mathematics) , distance hereditary graph , vertex connectivity , connected component , induced subgraph , strongly connected component , biconnected graph , graph factorization , factor critical graph , vertex (graph theory) , graph , discrete mathematics , line graph , graph power , mathematical analysis
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 ≥ 4, containing no induced subgraph isomorphic to K 1,3 , is Hamilton‐connected if and only if G is 3‐connected. © 1996 John Wiley & Sons, Inc.