Connectivity in digraphs

DOI10.1016/0095-8956(73)90018-XzbMath0264.05113MaRDI QIDQ2561604

László Lovász

Publication date: 1973

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (9)

Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity ⋮ Flow symmetry and algebraic flows ⋮ The flow network method ⋮ Greedoids from flames ⋮ FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs ⋮ Enlarging vertex-flames in countable digraphs ⋮ A good algorithm for edge-disjoint branching ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ Degree and local connectivity in digraphs

Cites Work

• Two Theorems on Pseudosymmetric Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity in digraphs