Disjoint paths in graphs. III: Characterization

DOI10.1007/s00026-003-0183-1zbMath1020.05037OpenAlexW1964660391MaRDI QIDQ1407501

Xingxing Yu

Publication date: 16 September 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

obstructionsconnectivity

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Combined Degree and Connectivity Conditions for $H$-Linked Graphs ⋮ Linking four vertices in graphs of large connectivity ⋮ Optimal connectivity for fat-triangle linkages ⋮ Long cycles containing \(k\)-ordered vertices in graphs ⋮ 7-connected graphs are 4-ordered ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Connectivity for Kite-Linked Graphs ⋮ Rooted topological minors on four vertices