Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs

DOI10.1002/jgt.21663zbMath1264.05079MaRDI QIDQ4920656

Jun Fujisawa

Publication date: 21 May 2013

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

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

zbMATH Keywords

Hamiltonian cycle; claw-free graphs; forbidden subgraphs; Ryjáčeks closure

Mathematics Subject Classification ID

05C38: Paths and cycles

05C75: Structural characterization of families of graphs

05C45: Eulerian and Hamiltonian graphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs, Hamilton circuits and essential girth of 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, A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices, On \(s\)-Hamiltonicity of net-free line graphs, The local structure of claw-free graphs without induced generalized bulls, Forbidden pairs and the existence of a dominating cycle, Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs

Cites Work

• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian
• Claw-free 3-connectedP11-free graphs are hamiltonian
• Hamiltonian results inK1,3-free graphs
• Critical graphs for subpancyclicity of 3-connected claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Hamiltonicity and forbidden subgraphs in 4‐connected graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs