Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs

DOI10.1016/j.disc.2014.05.018zbMath1298.05193OpenAlexW2088659326MaRDI QIDQ400354

Limning Xiong

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.05.018

zbMATH Keywords

claw-free graphHamiltonian cyclesupereulerian graphinduced hourglass

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Even factors with a bounded number of components in iterated line graphs ⋮ Forbidden subgraphs for supereulerian and Hamiltonian graphs ⋮ Pairs of forbidden subgraphs and 2-connected supereulerian graphs ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Forbidden pairs for spanning (closed) trails ⋮ Supereulerian line graphs

Cites Work

• Hamiltonian connectedness in 3-connected line graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Hamiltonian iterated line graphs
• Closure operation for even factors on claw-free graphs
• On factors of 4-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• A Note on Sub-Eulerian Graphs
• Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item