Graph minors. V. Excluding a planar graph

DOI10.1016/0095-8956(86)90030-4zbMath0598.05055WikidataQ56235113 ScholiaQ56235113MaRDI QIDQ1079583

Neil Robertson, P. D. Seymour

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90030-4

zbMATH Keywords

planar graphs; tree-width; graph minors; contraction of subgraphs; Minors of graphs

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Unnamed Item, Shortcutting Planar Digraphs, Graph minors. X: Obstructions to tree-decomposition, Decomposing infinite graphs, Excluding infinite minors, Canonical representations of partial 2- and 3-trees, A partial k-arboretum of graphs with bounded treewidth, Highly connected sets and the excluded grid theorem, Obstruction set isolation for the gate matrix layout problem, On search, decision, and the efficiency of polynomial-time algorithms, A simpler proof of the excluded minor theorem for higher surfaces, On interval routing schemes and treewidth, Clique-sums, tree-decompositions and compactness, The monadic second-order logic of graphs. VIII: Orientations, On tree-partitions of graphs, Upper bounds to the clique width of graphs, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues