A simpler proof of the excluded minor theorem for higher surfaces

DOI10.1006/JCTB.1997.1761zbMATH Open0882.05053OpenAlexW2028348726MaRDI QIDQ1362099FDOQ1362099

Carsten Thomassen

Publication date: 12 August 1997

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

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

Recommendations

• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Graph minors and graphs on surfaces
• Graph minors: generalizing Kuratowski's theorem
• scientific article; zbMATH DE number 3887721

zbMATH Keywords

surfacegridembeddingminorgenusKuratowski theorem

Mathematics Subject Classification ID

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

Cites Work

• Graphs on surfaces
• Embeddings of graphs with no short noncontractible cycles
• Graph minors. V. Excluding a planar graph
• A Kuratowski theorem for nonorientable surfaces
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• The genus of the 2-amalgamations of graphs
• Additivity of the genus of a graph
• Graph minors. IV: Tree-width and well-quasi-ordering
• Title not available (Why is that?)
• Combinatorial Local Planarity and the Width of Graph Embeddings
• Solution to König's Graph Embedding Problem

Cited In (18)

• Parameterized complexity of the spanning tree congestion problem
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Embedding grids in surfaces
• Spanners in sparse graphs
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
• Branch-width and well-quasi-ordering in matroids and graphs.
• Highly connected sets and the excluded grid theorem
• Branch-width and Rota's conjecture
• Contraction obstructions for treewidth
• Some recent progress and applications in graph minor theory
• Graph minors: generalizing Kuratowski's theorem
• The kernelization complexity of connected domination in graphs with (no) small cycles
• Computing crossing numbers in quadratic time
• The Jordan-Schonflies Theorem and the Classification of Surface
• Graph minors and graphs on surfaces
• Grids and their minors
• Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs
• MSOL restricted contractibility to planar graphs

This page was built for publication: A simpler proof of the excluded minor theorem for higher surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362099)