Cycle extendability in graphs and digraphs

DOI10.1016/j.laa.2010.04.038zbMath1221.05215OpenAlexW2051382735MaRDI QIDQ550650

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

zbMATH Keywords

Hamiltoniandirected graphtournamentcycle-extendable

Mathematics Subject Classification ID

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

Related Items (3)

Further results on Hendry's Conjecture ⋮ Regular tournaments with minimum split domination number and cycle extendability ⋮ Connectivity and extendability in digraphs

Cites Work

• Extending cycles in directed graphs
• Extending cycles in graphs
• Planar Hamiltonian chordal graphs are cycle extendable
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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