Note on Halin's theorem on minimally connected graphs

DOI10.1016/0095-8956(74)90039-2zbMath0279.05110OpenAlexW2018096646MaRDI QIDQ1394233

D. Massart

Publication date: 1974

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(74)90039-2

Mathematics Subject Classification ID

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

Related Items (6)

On Vertices of outdegree n in minimally n‐connected digraphs ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Quelques problèmes de connexite dans les graphes orientes ⋮ Unnamed Item ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) ⋮ Extremal results for directed tree connectivity

Cites Work

• A theorem on n-connected graphs
• Unnamed Item

This page was built for publication: Note on Halin's theorem on minimally connected graphs