Graph minors. XVII: Taming a vortex

DOI10.1006/jctb.1999.1919zbMath1027.05088OpenAlexW2336629689MaRDI QIDQ1569044

Neil Robertson, P. D. Seymour

Publication date: 25 June 2000

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

Full work available at URL: https://doi.org/10.1006/jctb.1999.1919

zbMATH Keywords

surfacegenusembedded graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Related Items

Fixed-Parameter Tractability of Treewidth and Pathwidth, Graph Minors and Parameterized Algorithm Design, Some recent progress and applications in graph minor theory, On the excluded minor structure theorem for graphs of large tree-width, The Erdős-Pósa property for clique minors in highly connected graphs, Linear connectivity forces large complete bipartite minors: an alternative approach, Graph minors. XIX: Well-quasi-ordering on a surface., Graph minors. XX: Wagner's conjecture, Turing kernelization for finding long paths in graph classes excluding a topological minor, Graph minor theory, Linear connectivity forces large complete bipartite minors, Graph minors. XXI. graphs with unique linkages, A partial k-arboretum of graphs with bounded treewidth, Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, On the immersion relation and an embedding problem for infinite graphs

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XVI: Excluding a non-planar graph