Critical vertices in \(k\)-connected digraphs

DOI10.1007/s12188-016-0173-yzbMath1448.05120OpenAlexW2587669528MaRDI QIDQ1688272

W. Mader

Publication date: 5 January 2018

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12188-016-0173-y

zbMATH Keywords

\(k\)-connected digraphsconnectivity-critical verticessurvey on \(k\)-critical graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs)
• Generalizaions of critical connectivity of graphs
• Vertices of small degree in critically \(n\)-connected digraphs
• Note on Halin's theorem on minimally connected graphs
• Zur Theorie der n-fach zusammenhängenden Graphen
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Kreise beschränkter Länge in gewissen minimalen n-fach zusammenhängenden Graphen
• Unendliche minimale \(n\)-fach zusammenhängende Graphen
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• High connectivity keeping sets in graphs and digraphs
• Connectivity keeping trees in k-connected graphs
• On Vertices of outdegree n in minimally n‐connected digraphs
• On critically connected digraphs
• A theorem on n-connected graphs
• Critically n-Connected Graphs
• Minimally n-line connected graphs.

This page was built for publication: Critical vertices in \(k\)-connected digraphs