Disjoint paths in graphs. III: Characterization

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

Authors 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

connectivityobstructions

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 4089593
• Disjoint paths in graphs. (Reprint)
• Disjoint paths in graphs. II: A special case
• Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
• Disjoint paths in graphs
• Disjoint A-paths in digraphs
• Disjoint Paths in a Planar Graph—A General Theorem
• Disjoint paths in decomposable digraphs
• Disjoint Paths—A Survey
• Disjoint paths in sparse graphs

Cited in

(12)

• Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
• Disjoint paths in graphs. II: A special case
• Rooted topological minors on four vertices
• 7-connected graphs are 4-ordered
• Long cycles containing k-ordered vertices in graphs
• Disjoint A-paths in digraphs
• Linking four vertices in graphs of large connectivity
• Optimal connectivity for fat-triangle linkages
• Combined degree and connectivity conditions for H-linked graphs
• Connectivity for kite-linked graphs
• K₅-subdivisions in graphs containing K₄^-
• The Kelmans-Seymour conjecture. IV: A proof

This page was built for publication: Disjoint paths in graphs. III: Characterization

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