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

DOI10.1007/s00026-003-0183-1zbMath1017.05060OpenAlexW1964660391MaRDI QIDQ1400805

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)

Related Items (8)

Linkage for the diamond and the path with four vertices ⋮ Linking four vertices in graphs of large connectivity ⋮ Biased graphs with no two vertex-disjoint unbalanced cycles ⋮ 7-connected graphs are 4-ordered ⋮ A simpler proof for the two disjoint odd cycles theorem ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ 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