Cycle extendability in graphs and digraphs

DOI10.1016/J.LAA.2010.04.038MaRDI QIDQ550650zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

directed graphHamiltoniantournamentcycle-extendable

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3293648 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Cycle Extendability of Hamiltonian Interval Graphs
• Extending cycles in directed graphs
• Extending cycles in graphs
• On cycle- and bi-cycle extendability in chordal and chordal bipartite graphs
• Planar Hamiltonian chordal graphs are cycle extendable

Cited in

(14)

• Planar Hamiltonian chordal graphs are cycle extendable
• Extending cycles in graphs
• Extending cycles in directed graphs
• scientific article; zbMATH DE number 6096657 (Why is no real title available?)
• Further results on Hendry's Conjecture
• Connectivity and extendability in digraphs
• scientific article; zbMATH DE number 841659 (Why is no real title available?)
• Cycle extendability in extended tournaments
• Hamiltonian chordal graphs are not cycle extendable
• Additional Closeness of Cycle Graphs
• Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
• Extremal and degree conditions for path extendability in digraphs
• Regular tournaments with minimum split domination number and cycle extendability
• Hamiltonian spider intersection graphs are cycle extendable

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)