Contractions to k8
From MaRDI portal
Publication:4304249
Recommendations
- scientific article; zbMATH DE number 4053652
- scientific article; zbMATH DE number 4120196
- A constructive characterization of contraction critical 8-connected graphs with minimum degree 9
- Contractible edges in 7-connected graphs
- Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
Cites work
Cited in
(36)- The extremal function and Colin de Verdière graph parameter
- Average degree conditions forcing a minor
- The extremal function for disconnected minors
- The extremal functions for triangle-free graphs with excluded minors
- scientific article; zbMATH DE number 4053652 (Why is no real title available?)
- Forcing a sparse minor
- A decomposition method on solving the linear arboricity conjecture
- Bipartite graphs with no \(K_6\) minor
- On a recolouring version of Hadwiger's conjecture
- A note on odd colorings of 1-planar graphs
- Linear connectivity forces large complete bipartite minors
- The extremal function for \(K_{8}^{-}\) minors
- Graphs without minor complete subgraphs
- Local degree conditions for \({K}_9\)-minors in graphs
- Extremal functions for sparse minors
- \(K_{6}\) minors in large 6-connected graphs
- The extremal function for complete minors
- A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
- Cliques in graphs excluding a complete graph minor
- Coloring graphs with forbidden minors
- Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors
- Surfaces, tree-width, clique-minors, and partitions
- Some recent progress and applications in graph minor theory
- The extremal function for Petersen minors
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- The extremal function for \(K_{9}\) minors
- Recent progress towards Hadwiger's conjecture
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Hadwiger's conjecture
- On the critical densities of minor-closed classes
- Cliques, minors and apex graphs
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width
- A characterization of graphs with no octahedron minor
- A lower bound on the average degree forcing a minor
- Asymptotic density of graphs excluding disconnected minors
- Tournaments as strong subcontractions
This page was built for publication: Contractions to k8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304249)