On critically connected digraphs

DOI10.1002/jgt.3190130412zbMath0684.05022OpenAlexW2033567934MaRDI QIDQ4733875

W. Mader

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130412

zbMATH Keywords

critically connected finite digraph

Mathematics Subject Classification ID

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

Related Items (4)

Connectivity keeping trees in k-connected graphs ⋮ Critical vertices in \(k\)-connected digraphs ⋮ Vertices of small degree in critically \(n\)-connected digraphs ⋮ High connectivity keeping sets in graphs and digraphs

Cites Work

• On k-critical, n-connected graphs

This page was built for publication: On critically connected digraphs