On Vertices of outdegree n in minimally n‐connected digraphs

DOI10.1002/jgt.10018zbMath0999.05049OpenAlexW2012413969MaRDI QIDQ4534212

W. Mader

Publication date: 2 December 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10018

zbMATH Keywords

indegreeoutdegreefinite digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

Critical vertices in \(k\)-connected digraphs ⋮ On minimally 2-\(T\)-connected directed graphs ⋮ High connectivity keeping sets in graphs and digraphs ⋮ Extremal results for directed tree connectivity

Cites Work

• Unnamed Item
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Note on Halin's theorem on minimally connected graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Schnittverbände in Graphen. (Intersection lattices in graphs)
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• A theorem on n-connected graphs

This page was built for publication: On Vertices of outdegree n in minimally n‐connected digraphs