Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen

DOI10.1007/BF01238648zbMath0259.05115MaRDI QIDQ2560257

W. Mader

Publication date: 1974

Published in: Archiv der Mathematik (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (12)

On Vertices of outdegree n in minimally n‐connected digraphs ⋮ Unnamed Item ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Critical vertices in \(k\)-connected digraphs ⋮ On a property of n-edge-connected digraphs ⋮ Konstruktion aller n-fach kantenzusammenhaengenden Digraphen ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ Unnamed Item ⋮ Recent results on well-balanced orientations ⋮ Submodular functions in graph theory ⋮ On k-minimally n-edge-connected graphs ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)

Cites Work

• Unnamed Item
• Unnamed Item
• On basis diagraphs
• Minimally n-line connected graphs.

This page was built for publication: Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen