TY - JOUR

T1 - Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs

AU - Fujisawa, Jun

PY - 2013/6

Y1 - 2013/6

N2 - In this article, we consider forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. Let Zi be the graph obtained from a triangle by attaching a path of length i to one of its vertices, and let Q* be the graph obtained from the Petersen graph by adding one pendant edge to each vertex. Lai et al. (J Graph Theory 64(1) (2010), 1-11) conjectured that every 3-connected {K1,3,Z9}-free graph G is hamiltonian unless G is the line graph of Q. It is shown in this article that this conjecture is true. Moreover, we investigate the set of connected graphs A3 which satisfies that every 3-connected {K1,3,A}-free graph of sufficiently large order is hamiltonian if and only if A is a member of A3. We prove that, if Gâ̂̂A3, then G is a graph on at most 12 vertices with the following structure: (i) a path of length at most 10, (ii) a triangle with three vertex-disjoint paths of total length at most 9, or (iii) G consists of two triangles connected by a path of length 1, 3, 5, or 7. AMS classification: 05C45, 05C38, 05C75.

AB - In this article, we consider forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. Let Zi be the graph obtained from a triangle by attaching a path of length i to one of its vertices, and let Q* be the graph obtained from the Petersen graph by adding one pendant edge to each vertex. Lai et al. (J Graph Theory 64(1) (2010), 1-11) conjectured that every 3-connected {K1,3,Z9}-free graph G is hamiltonian unless G is the line graph of Q. It is shown in this article that this conjecture is true. Moreover, we investigate the set of connected graphs A3 which satisfies that every 3-connected {K1,3,A}-free graph of sufficiently large order is hamiltonian if and only if A is a member of A3. We prove that, if Gâ̂̂A3, then G is a graph on at most 12 vertices with the following structure: (i) a path of length at most 10, (ii) a triangle with three vertex-disjoint paths of total length at most 9, or (iii) G consists of two triangles connected by a path of length 1, 3, 5, or 7. AMS classification: 05C45, 05C38, 05C75.

KW - Hamiltonian cycle

KW - Ryjáč eks closure

KW - claw-free graphs

KW - forbidden subgraphs

UR - http://www.scopus.com/inward/record.url?scp=84875832669&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875832669&partnerID=8YFLogxK

U2 - 10.1002/jgt.21663

DO - 10.1002/jgt.21663

M3 - Article

AN - SCOPUS:84875832669

SN - 0364-9024

VL - 73

SP - 146

EP - 160

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 2

ER -