Claw-free 3-connectedP11-free graphs are hamiltonian

DOI10.1002/jgt.20019zbMath1055.05097MaRDI QIDQ3159394

Florian Pfender, Tomasz Łuczak

Publication date: 16 February 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20019

zbMATH Keywords

Hamilton cycle; claw-free graphs; forbidden subgraphs

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Pancyclicity of 4‐Connected, Claw‐Free, P₁₀‐Free Graphs, Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs, Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs, Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian, Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs, The local structure of claw-free graphs without induced generalized bulls, Recent advances on the Hamiltonian problem: survey III, Forbidden pairs and the existence of a dominating cycle, Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs, Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian, Critical graphs for subpancyclicity of 3-connected claw-free graphs

Cites Work

• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item