Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)

DOI10.1016/0095-8956(85)90076-0zbMath0578.05045OpenAlexW2052184941MaRDI QIDQ1066160

W. Mader

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90076-0

zbMATH Keywords

forestextremal digraphsalternating cycleminimally n-connected digraph

Mathematics Subject Classification ID

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

Related Items (12)

On Vertices of outdegree n in minimally n‐connected digraphs ⋮ Minimum 2-vertex strongly biconnected spanning directed subgraph problem ⋮ On Vertex-Edge-Critically n-Connected Graphs ⋮ Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Small \(\ell\)-edge-covers in \(k\)-connected graphs ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ High connectivity keeping sets in graphs and digraphs ⋮ On minimally \((n,\lambda)\)-connected graphs ⋮ Extremal results for directed tree connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimally k-connected graphs of low order and maximal size
• Quelques problèmes de connexite dans les graphes orientes
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Note on Halin's theorem on minimally connected graphs
• Unendliche minimale \(n\)-fach zusammenhängende Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• Cycles in digraphs– a survey
• A theorem on n-connected graphs
• Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.

This page was built for publication: Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)