Connectivity in digraphs

DOI10.1016/0095-8956(73)90018-XMaRDI QIDQ2561604zbMATH OpenFDO

Authors László Lovász

Publication date 1973

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(73)90018-X

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3153738 (Why is no real title available?)
• scientific article; zbMATH DE number 3307343 (Why is no real title available?)
• Two Theorems on Pseudosymmetric Graphs

Cited in

(12)

• Degree and local connectivity in digraphs
• A good algorithm for edge-disjoint branching
• Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
• An analogue of Hoffman's circulation conditions for max-balanced flows
• Enlarging vertex-flames in countable digraphs
• The flow network method
• Flow symmetry and algebraic flows
• Greedoids from flames
• FPT algorithms for packing k-safe spanning rooted sub(di)graphs
• A solution for abstract decision problems based on maximum flow value
• On some algorithmic and structural results on flames
• Directed hypergraph connectivity augmentation by hyperarc reorientations

This page was built for publication: Connectivity in digraphs

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