Connectivity and extendability in digraphs

DOI10.1007/978-3-031-05375-7_19zbMath1500.05022OpenAlexW4295836553MaRDI QIDQ2089552

Leroy B. Beasley

Publication date: 22 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05375-7_19

zbMATH Keywords

connectedness of cyclesconnectedness of pathsextendability of cyclesextendability of paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Cycle extendability in graphs and digraphs
• Extending cycles in directed graphs
• Extending cycles in graphs
• Path extendable graphs
• Hamiltonian Chordal Graphs are not Cycle Extendable
• Extremal and Degree Conditions for Path Extendability in Digraphs
• Cycle Extendability of Hamiltonian Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity and extendability in digraphs