Connectivity and extendability in digraphs
From MaRDI portal
Publication:2089552
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
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)
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)