scientific article; zbMATH DE number 863474
From MaRDI portal
Publication:4871753
\(k\)-path problemcrossingsdecompositionsdrawingsembeddingsHadwiger's conjectureHeawood conjectureminorsplanar graphssurfacestree widthwell-quasi-orderings
Complexity of computation (including implicit computational complexity) (03D15) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Recommendations
Cited in
(19)- A spectral lower bound for the treewidth of a graph and its consequences
- Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- Highly connected sets and the excluded grid theorem
- Embeddings of graphs
- A simpler proof of the excluded minor theorem for higher surfaces
- Tree-width, clique-minors, and eigenvalues.
- On covers of graphs
- High-girth graphs avoiding a minor are nearly bipartite
- Coloring face-hypergraphs of graphs on surfaces
- An extended tree-width notion for directed graphs related to the computation of permanents
- The reverse mathematics of wqos and bqos
- Minimalp-extensions and the embedding problem
- Kernelization of Whitney switches
- Odd complete minors in even embeddings on surfaces
- Kernelization of Whitney Switches
- On topological diversity of rectilinear representations of countably infinite graphs
- On Torsor Structures on Spanning Trees
- Some recent progress and applications in graph minor theory
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)
