A simpler proof of the excluded minor theorem for higher surfaces
From MaRDI portal
(Redirected from Publication:1362099)
Recommendations
Cites work
- scientific article; zbMATH DE number 863474 (Why is no real title available?)
- A Kuratowski theorem for nonorientable surfaces
- Additivity of the genus of a graph
- Combinatorial Local Planarity and the Width of Graph Embeddings
- Embeddings of graphs with no short noncontractible cycles
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. V. Excluding a planar graph
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graphs on surfaces
- Solution to König's Graph Embedding Problem
- The genus of the 2-amalgamations of graphs
Cited in
(19)- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Parameterized complexity of the spanning tree congestion problem
- Highly connected sets and the excluded grid theorem
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Spanners in sparse graphs
- The Jordan-Schonflies Theorem and the Classification of Surface
- Vertex-bipartition method for colouring minor-closed classes of graphs
- Contraction obstructions for treewidth
- Computing crossing numbers in quadratic time
- Some recent progress and applications in graph minor theory
- Graph minors and graphs on surfaces
- Grids and their minors
- Embedding grids in surfaces
- Branch-width and Rota's conjecture
- Branch-width and well-quasi-ordering in matroids and graphs.
- MSOL restricted contractibility to planar graphs
- The kernelization complexity of connected domination in graphs with (no) small cycles
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
- Graph minors: generalizing Kuratowski's theorem
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)
