Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian

DOI10.1002/jgt.20433zbMath1205.05134MaRDI QIDQ3055900

Hong-Jian Lai, Limning Xiong, Jin Yan, Huiya Yan

Publication date: 10 November 2010

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

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

zbMATH Keywords

claw-free graphs; forbidden subgraphs; Hamiltonian graphs; supereulerian graphs

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs, Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs, Hamilton circuits and essential girth of claw free graphs, A note on edge-disjoint Hamilton cycles in line graphs, Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles, Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian, 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

Cites Work

• Unnamed Item
• On a closure concept in claw-free graphs
• Claw-free 3-connectedP11-free graphs are hamiltonian
• A reduction method to find spanning Eulerian subgraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs