Disjoint paths in graphs. (Reprint)

DOI10.1016/J.DISC.2006.03.019MaRDI QIDQ2497998zbMATH OpenOpenAlexFDO

Authors Paul Seymour

Publication date 4 August 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.03.019

zbMATH Keywords

Menger's theoremvertex disjoint pathsedge disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Paths and edge-connectivity in graphs
• Disjoint Paths in a Planar Graph—A General Theorem
• scientific article; zbMATH DE number 4089593
• Menger's theorem
• A mixed version of Menger's theorem

Cites work

• A short proof of the two-commodity flow theorem
• Four-terminus flows
• Multi-Commodity Network Flows
• On Odd Cuts and Plane Multicommodity Flows
• On the Complexity of Timetable and Multicommodity Flow Problems
• The directed subgraph homeomorphism problem
• The subgraph homeomorphism problem
• Über die Maximalzahl kantendisjunkter A-Wege

Cited in

(27)

• LATIN 2004: Theoretical Informatics
• Paths and edge-connectivity in graphs
• A generalization of an important lemma related to the Murty-Simon conjecture
• scientific article; zbMATH DE number 524123 (Why is no real title available?)
• Reconstructing edge-disjoint paths.
• Disjoint A-paths in digraphs
• Graph-Theoretic Concepts in Computer Science
• Disjoint paths in symmetric digraphs
• scientific article; zbMATH DE number 4023311 (Why is no real title available?)
• Disjoint non-balanced A-paths in biased graphs
• Hardness of finding two edge-disjoint Min-Min paths in digraphs
• Disjoint Paths in a Planar Graph—A General Theorem
• Note on Whitney's theorem for k-connected graphs
• Mader tools
• A proof of Menger's Theorem by contraction
• On the complexity of the edge-disjoint min-min problem in planar digraphs
• Vertex-disjoint paths and edge-disjoint branchings in directed graphs
• Local edge and local node connectivity in regular graphs
• Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• A short proof of Mader's \(\mathcal S\)-paths theorem
• Disjoint paths in graphs. II: A special case
• Disjoint paths in graphs. III: Characterization
• Disjoint edge paths between given vertices of a convex polytope
• scientific article; zbMATH DE number 4089593 (Why is no real title available?)
• scientific article; zbMATH DE number 2188351 (Why is no real title available?)
• On finding Min-Min disjoint paths

This page was built for publication: Disjoint paths in graphs. (Reprint)

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