Graph minors. XII: Distance on a surface

DOI10.1006/jctb.1995.1034zbMath0840.05016OpenAlexW2028037658MaRDI QIDQ1898721

Neil Robertson, P. D. Seymour

Publication date: 4 July 1996

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

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

zbMATH Keywords

embeddingtanglesgraph minorsrepresentativitystructure of graphsnonspherical surfacedistance on a surfacemetric on a surfacenoncontractible curve

Mathematics Subject Classification ID

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

Related Items

Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs, Excluding subdivisions of bounded degree graphs, Fixed-Parameter Tractability of Treewidth and Pathwidth, Quickly deciding minor-closed parameters in general graphs, Some recent progress and applications in graph minor theory, Immersion in four-edge-connected graphs, Graph minors. XXII. Irrelevant vertices in linkage problems, Packing topological minors half‐integrally, Graph minors. XVI: Excluding a non-planar graph, The theory of guaranteed search on graphs, Subexponential parameterized algorithms, Graph minors. XIX: Well-quasi-ordering on a surface., Graph minors. X: Obstructions to tree-decomposition, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, Graph minors. XXI. graphs with unique linkages, A partial k-arboretum of graphs with bounded treewidth, Dynamic programming for graphs on surfaces