Grids and their minors

DOI10.1016/0095-8956(89)90033-6zbMath0636.05023OpenAlexW2070637453MaRDI QIDQ1097897

Detlef Seese, Walter Wessel

Publication date: 1989

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(89)90033-6

zbMATH Keywords

surfaceminorgraphs

Mathematics Subject Classification ID

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

Related Items (4)

Some recent progress and applications in graph minor theory ⋮ Graph minors. XVI: Excluding a non-planar graph ⋮ Unnamed Item ⋮ The structure of the models of decidable monadic theories of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. III. Planar tree-width
• Graph minors. I. Excluding a forest
• Graph minors. VI. Disjoint paths across a disc
• Graph minors. V. Excluding a planar graph
• Graph minors. VII: Disjoint paths on a surface
• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XI: Circuits on a surface
• Graph minors. XVI: Excluding a non-planar graph
• Graph minors. IX: Disjoint crossed paths
• Graph minors. IV: Tree-width and well-quasi-ordering
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Graph minors. II. Algorithmic aspects of tree-width
• A combinatorial and logical approach to linear-time computability (extended abstract)
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: Grids and their minors