Vertices of small degree in critically \(n\)-connected digraphs

DOI10.1016/0095-8956(91)90077-WzbMath0751.05063MaRDI QIDQ1186137

W. Mader

Publication date: 28 June 1992

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

zbMATH Keywords

degreecritically \(n\)-connected digraph

Mathematics Subject Classification ID

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

Related Items

Connectivity keeping trees in k-connected graphs, Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs, Existence of vertices of local connectivity \(k\) in digraphs of large outdegree, Critical vertices in \(k\)-connected digraphs, Some mader-perfect graph classes, Dichromatic number and forced subdivisions, High connectivity keeping sets in graphs and digraphs

Cites Work

• Unnamed Item
• Non-\(\kappa\)-critical vertices in graphs
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• On critically h-connected simple graphs
• Quelques problèmes de connexite dans les graphes orientes
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• On critically connected digraphs
• Critically n-Connected Graphs
• Eine Eigenschaft der Atome endlicher Graphen