Hamiltonian Chordal Graphs are not Cycle Extendable

DOI10.1137/13094551XzbMath1314.05104arXiv1311.5863OpenAlexW2962895234MaRDI QIDQ5254087

Ben Seamone, Manuel Lafond

Publication date: 8 June 2015

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

Full work available at URL: https://arxiv.org/abs/1311.5863

zbMATH Keywords

cycleschordal graphsHamiltonian graphscycle extendibilityHendry's conjecture

Mathematics Subject Classification ID

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

Related Items (9)

Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Further results on Hendry's Conjecture ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Toughness and Hamiltonicity of strictly chordal graphs ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Cycle Extendability of Hamiltonian Strongly Chordal Graphs ⋮ Global cycle properties in graphs with large minimum clustering coefficient ⋮ Connectivity and extendability in digraphs

Cites Work

• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Extending cycles in graphs
• On rigid circuit graphs
• Fully cycle extendability of \(K_{1,4}\)-restricted graphs
• Characterizations of strongly chordal graphs
• Planar Hamiltonian chordal graphs are cycle extendable
• Incidence matrices and interval graphs
• Pancyclic graphs. I
• Graph Classes: A Survey
• Almost claw‐free graphs
• Locally connected graphs
• Hamiltonian Spider Intersection Graphs Are Cycle Extendable
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs
• Unnamed Item

This page was built for publication: Hamiltonian Chordal Graphs are not Cycle Extendable