A simpler proof of the excluded minor theorem for higher surfaces

DOI10.1006/jctb.1997.1761zbMath0882.05053OpenAlexW2028348726MaRDI QIDQ1362099

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

zbMATH Keywords

surfaceembeddingminorgenusgridKuratowski theorem

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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