Disjoint paths in graphs. I: 3-planar graphs and basic obstructions

DOI10.1007/S00026-003-0183-1MaRDI QIDQ1400805zbMATH OpenOpenAlexFDO

Authors Xingxing Yu

Publication date 14 August 2003

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-003-0183-1

zbMATH Keywords

planar graphdisjoint pathslinkage

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Disjoint paths in graphs. III: Characterization
• Disjoint paths in graphs. (Reprint)
• Disjoint paths in graphs. II: A special case
• Disjoint Paths—A Survey
• Graph minors. XIII: The disjoint paths problem

Cited in

(13)

• Paths and metrics in a planar graph with three or more holes. I: Metrics
• Paths and metrics in a planar graph with three or more holes. II: Paths
• The Kelmans-Seymour conjecture. IV: A proof
• Disjoint paths in graphs. II: A special case
• Disjoint paths in graphs. III: Characterization
• A simpler proof for the two disjoint odd cycles theorem
• Disjoint Paths in a Planar Graph—A General Theorem
• 7-connected graphs are 4-ordered
• Biased graphs with no two vertex-disjoint unbalanced cycles
• Linkage for the diamond and the path with four vertices
• Linking four vertices in graphs of large connectivity
• Connectivity for kite-linked graphs
• Rooted topological minors on four vertices

This page was built for publication: Disjoint paths in graphs. I: 3-planar graphs and basic obstructions

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