scientific article; zbMATH DE number 863474
zbMATH Open0851.05043MaRDI QIDQ4871753FDOQ4871753
Authors: Carsten Thomassen 
Publication date: 8 April 1996
Title of this publication is not available (Why is that?)
Recommendations
embeddingsHadwiger's conjecturesurfacesplanar graphsdecompositionsminorscrossingstree widthHeawood conjecturedrawingswell-quasi-orderings\(k\)-path problem
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (19)
- Minimalp-extensions and the embedding problem
- Kernelization of Whitney Switches
- On topological diversity of rectilinear representations of countably infinite graphs
- Embeddings of graphs
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- Highly connected sets and the excluded grid theorem
- Coloring face-hypergraphs of graphs on surfaces
- Some recent progress and applications in graph minor theory
- An extended tree-width notion for directed graphs related to the computation of permanents
- On Torsor Structures on Spanning Trees
- Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs
- On covers of graphs
- High-girth graphs avoiding a minor are nearly bipartite
- A spectral lower bound for the treewidth of a graph and its consequences
- Kernelization of Whitney switches
- Odd complete minors in even embeddings on surfaces
- A simpler proof of the excluded minor theorem for higher surfaces
- Tree-width, clique-minors, and eigenvalues.
- The reverse mathematics of wqos and bqos
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871753)
