Note on Halin's theorem on minimally connected graphs

DOI10.1016/0095-8956(74)90039-2MaRDI QIDQ1394233zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A theorem on n-connected graphs
• scientific article; zbMATH DE number 3156013 (Why is no real title available?)

Cited in

(6)

• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Quelques problèmes de connexite dans les graphes orientes
• Critical vertices in k-connected digraphs
• Extremal results for directed tree connectivity
• scientific article; zbMATH DE number 3769658 (Why is no real title available?)
• On Vertices of outdegree n in minimally n‐connected digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394233)