Contractions to k8

DOI10.1002/JGT.3190180502MaRDI QIDQ4304249zbMATH OpenOpenAlexFDO

Authors

Publication date 9 March 1995

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190180502

zbMATH Keywords

\(K_ 5(2)\)-cockadecontractiblecontractions

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

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

• 2-linked graphs

Cited in

(38)

• Linear connectivity forces large complete bipartite minors
• Cliques, minors and apex graphs
• Tournaments as strong subcontractions
• The extremal functions for triangle-free graphs with excluded minors
• On the critical densities of minor-closed classes
• The extremal function for Petersen minors
• The extremal function and Colin de Verdière graph parameter
• On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
• Surfaces, tree-width, clique-minors, and partitions
• The extremal function for complete minors
• Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors
• A lower bound on the average degree forcing a minor
• Asymptotic density of graphs excluding disconnected minors
• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
• The extremal function for disconnected minors
• Coloring graphs with forbidden minors
• \(K_{6}\) minors in 6-connected graphs of bounded tree-width
• The extremal function for \(K_{9}\) minors
• The extremal function for \(K_{8}^{-}\) minors
• Average degree conditions forcing a minor
• A note on odd colorings of 1-planar graphs
• Hadwiger's conjecture
• A characterization of graphs with no octahedron minor
• Cliques in graphs excluding a complete graph minor
• scientific article; zbMATH DE number 4053652 (Why is no real title available?)
• Forcing a sparse minor
• Extremal functions for sparse minors
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
• A decomposition method on solving the linear arboricity conjecture
• Bipartite graphs with no \(K_6\) minor
• On a recolouring version of Hadwiger's conjecture
• Recent progress towards Hadwiger's conjecture
• Local degree conditions for \({K}_9\)-minors in graphs
• \(K_{6}\) minors in large 6-connected graphs
• Extremal number of cliques of given orders in graphs with a forbidden clique minor
• On a recolouring version of Hadwiger's conjecture (extended abstract)
• Some recent progress and applications in graph minor theory
• Graphs without minor complete subgraphs

This page was built for publication: Contractions to k₈

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304249)