Cycle extendability in graphs and digraphs

DOI10.1016/J.LAA.2010.04.038zbMATH Open1221.05215OpenAlexW2051382735MaRDI QIDQ550650FDOQ550650

Authors: David E. Brown, Leroy B. Beasley 

Publication date: 13 July 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.038

Recommendations

• Planar Hamiltonian chordal graphs are cycle extendable
• Hamiltonian spider intersection graphs are cycle extendable
• Hamiltonian chordal graphs are not cycle extendable
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes

zbMATH Keywords

directed graphHamiltoniantournamentcycle-extendable

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Extending cycles in graphs
• Cycle Extendability of Hamiltonian Interval Graphs
• Planar Hamiltonian chordal graphs are cycle extendable
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• On cycle- and bi-cycle extendability in chordal and chordal bipartite graphs
• Title not available (Why is that?)
• Extending cycles in directed graphs

Cited In (10)

• Planar Hamiltonian chordal graphs are cycle extendable
• Extending cycles in graphs
• Extending cycles in directed graphs
• Title not available (Why is that?)
• Further results on Hendry's Conjecture
• Connectivity and extendability in digraphs
• Title not available (Why is that?)
• Additional Closeness of Cycle Graphs
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Regular tournaments with minimum split domination number and cycle extendability

This page was built for publication: Cycle extendability in graphs and digraphs

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