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

DOI10.1002/JGT.21663zbMATH Open1264.05079OpenAlexW1487160767MaRDI QIDQ4920656FDOQ4920656

Authors 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 cycleclaw-free graphsforbidden subgraphsRyjáčeks closure

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Hamilton cycles in 3-connected claw-free and net-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
• Hamiltonian connectedness in claw-free graphs
• Forbidden subgraphs that imply hamiltonian‐connectedness*

Cites Work

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

Cited In (12)

• The local structure of claw-free graphs without induced generalized bulls
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Forbidden pairs and the existence of a dominating cycle
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• Hamilton circuits and essential girth of claw free graphs
• On \(s\)-Hamiltonicity of net-free line graphs
• Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
• Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
• Hamilton cycles in 3-connected claw-free and net-free graphs
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
• Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs

This page was built for publication: Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920656)