On Vertices of outdegree n in minimally n‐connected digraphs
From MaRDI portal
Publication:4534212
Recommendations
Cites work
- A theorem on n-connected graphs
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
- Note on Halin's theorem on minimally connected graphs
- Schnittverbände in Graphen. (Intersection lattices in graphs)
- Zur Struktur minimal n-fach zusammenhängender Graphen
Cited in
(11)- Degree and local connectivity in digraphs
- Critical vertices in k-connected digraphs
- On minimally 2-T-connected directed graphs
- Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
- Extremal results for directed tree connectivity
- High connectivity keeping sets in graphs and digraphs
- Properties of \(k\)-critically \(n\)-connected digraphs
- Connectivity properties of locally semicomplete digraphs
- On critically connected digraphs
- scientific article; zbMATH DE number 878899 (Why is no real title available?)
- On vertices of outdegree k in minimally k-arc-connected digraphs
This page was built for publication: On Vertices of outdegree n in minimally n‐connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534212)