Connectivity and extendability in digraphs

DOI10.1007/978-3-031-05375-7_19zbMATH Open1500.05022OpenAlexW4295836553MaRDI QIDQ2089552FDOQ2089552

Authors: Leroy B. Beasley 

Publication date: 22 October 2022

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

Recommendations

• Extending cycles in directed graphs
• scientific article; zbMATH DE number 4162914
• Degree and local connectivity in digraphs
• Path extendable graphs
• scientific article; zbMATH DE number 4160767

zbMATH Keywords

connectedness of cyclesconnectedness of pathsextendability of cyclesextendability of paths

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Extending cycles in graphs
• Cycle Extendability of Hamiltonian Interval Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On cycle- and bi-cycle extendability in chordal and chordal bipartite graphs
• Cycle extendability in graphs and digraphs
• Title not available (Why is that?)
• Extending cycles in directed graphs
• Path extendable graphs
• Hamiltonian chordal graphs are not cycle extendable
• Extremal and degree conditions for path extendability in digraphs

Cited In (5)

• A characterization of extendable connectivity functions
• Graph connectivities, network coding, and expander graphs
• Connectivity of Imase and Itoh digraphs
• On computing the connectivities of graphs and digraphs
• Title not available (Why is that?)

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

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