Hamiltonian spider intersection graphs are cycle extendable

DOI10.1137/130914164MaRDI QIDQ5408600zbMATH OpenOpenAlexFDO

Authors Atif A. Abueida, R. Sritharan, Arthur H. Busch

Publication date 10 April 2014

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

Full work available at URL https://semanticscholar.org/paper/e70cf2d4188b5948d204633ab280c8c27eaab6a5

zbMATH Keywords

cycle extensionHamiltonian graphsintersection graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Hamiltonian chordal graphs are not cycle extendable
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• Planar Hamiltonian chordal graphs are cycle extendable
• Further results on Hendry's Conjecture
• Cycle extendability in graphs and digraphs

Cited in

(10)

• Recent advances on the Hamiltonian problem: survey III
• scientific article; zbMATH DE number 125465 (Why is no real title available?)
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• Hamiltonian chordal graphs are not cycle extendable
• Extremal and degree conditions for path extendability in digraphs
• Cycle extendability in graphs and digraphs
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs
• Further results on Hendry's Conjecture
• Toughness and Hamiltonicity of strictly chordal graphs

This page was built for publication: Hamiltonian spider intersection graphs are cycle extendable

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