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

DOI10.1002/JGT.21663MaRDI QIDQ4920656zbMATH OpenOpenAlexFDO

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

claw-free graphsforbidden subgraphsHamiltonian cycleRyjáčeks closure

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) 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 a closure concept in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

Cited in

(13)

• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
• Hamilton cycles in 3-connected claw-free and net-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
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• 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 circuits and essential girth of claw free graphs
• Forbidden pairs for traceability of 2-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)