On critically connected digraphs

DOI10.1002/JGT.3190130412MaRDI QIDQ4733875zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Properties of \(k\)-critically \(n\)-connected digraphs
• On Vertices of outdegree n in minimally n‐connected digraphs
• scientific article; zbMATH DE number 867644
• scientific article; zbMATH DE number 3896974
• Critical vertices in k-connected digraphs

Cites work

• On k-critical, n-connected graphs

Cited in

(14)

• Critical graphs with connected complements
• 2.5-connectivity: unique components, critical graphs, and applications
• On the existence of noncritical vertices in digraphs
• Connectivity keeping trees in k-connected graphs
• On the \(l\)-connectivity of a digraph
• scientific article; zbMATH DE number 4160762 (Why is no real title available?)
• The number of edges in critical strongly connected graphs
• Vertices of small degree in critically n-connected digraphs
• High connectivity keeping sets in graphs and digraphs
• Disconnected g_c-critical graphs
• Properties of \(k\)-critically \(n\)-connected digraphs
• Critical vertices in k-connected digraphs
• Connectivity properties of locally semicomplete digraphs
• On the number of noncritical vertices in strongly connected digraphs

This page was built for publication: On critically connected digraphs

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