Hamiltonicity in claw-free graphs

DOI10.1016/0095-8956(91)90074-TzbMath0766.05055MaRDI QIDQ1186134

F. Bruce Shepherd

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathtoughnessclaw-free graphshamiltonicityCN-free graphsleaf-connectedness

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected, Forbidden subgraphs that imply hamiltonian‐connectedness*, Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs, Claw-free graphs---a survey, Hamiltonian extendable graphs, Characterizing forbidden pairs for hamiltonian properties, Unnamed Item, Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs, Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs, Hamilton‐connected {claw, net}‐free graphs, I, Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls, Claw-free and \(N(2,1,0)\)-free graphs are almost net-free, On linear and circular structure of (claw, net)-free graphs, On Hamiltonicity of \{claw, net\}-free graphs, On local and global independence numbers of a graph, Recent advances on the Hamiltonian problem: survey III, Forbidden subgraphs for a graph to have a Hamiltonian path square, Pancyclicity of 4‐Connected, Claw‐Free, P₁₀‐Free Graphs, On Forbidden Pairs Implying Hamilton‐Connectedness, 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected, A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions, A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity, Forbidden subgraphs, hamiltonicity and closure in claw-free graphs, Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs

Cites Work

• Stability in CAN-free graphs
• Pancyclism in hamiltonian graphs
• The struction of a graph: Application to CN-free graphs
• On k-leaf-connected graphs
• Bull-free Berge graphs are perfect
• Forbidden subgraphs and Hamiltonian properties and graphs
• Bridges and Hamiltonian circuits in planar graphs
• Sufficient conditions for a graph to be Hamiltonian
• Pancyclic graphs. I
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Connected, locally 2-connected,K1,3-free graphs are panconnected
• Longest paths and cycles in K1,3-free graphs
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• A Note on Sub-Eulerian Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item