Hamiltonian Spider Intersection Graphs Are Cycle Extendable

DOI10.1137/130914164zbMath1301.05193OpenAlexW1979599997MaRDI QIDQ5408600

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

intersection graphsHamiltonian graphscycle extension

Mathematics Subject Classification ID

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

Related Items (6)

Further results on Hendry's Conjecture ⋮ 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 ⋮ Hamiltonian Chordal Graphs are not Cycle Extendable

This page was built for publication: Hamiltonian Spider Intersection Graphs Are Cycle Extendable