Graph minors. XIX: Well-quasi-ordering on a surface.

DOI10.1016/j.jctb.2003.08.005zbMath1035.05086OpenAlexW1970922939MaRDI QIDQ1426103

Neil Robertson, P. D. Seymour

Publication date: 14 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.08.005

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items

Fixed-Parameter Tractability of Treewidth and Pathwidth, Some recent progress and applications in graph minor theory, Upper Bounds on the Graph Minor Theorem, Excluding infinite minors, Graph minors. XX: Wagner's conjecture, Graph minor theory, Remarks on a paper of J. Barát and P.P. Varjú, Unnamed Item

Cites Work

• Graph minors. XX: Wagner's conjecture
• Graph minors. VI. Disjoint paths across a disc
• Graph minors. VII: Disjoint paths on a surface
• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XI: Circuits on a surface
• Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
• Graph minors. XVII: Taming a vortex
• Graph minors. XII: Distance on a surface
• Graph minors. XIV: Extending an embedding
• Graph minors. IV: Tree-width and well-quasi-ordering
• Graph minors. VIII: A Kuratowski theorem for general surfaces