Conjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs)

DOI10.1016/0012-365X(92)90604-EzbMath0753.05036OpenAlexW2056199150WikidataQ123007042 ScholiaQ123007042MaRDI QIDQ1197029

Jean Mayer

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90604-e

zbMATH Keywords

6-chromatic contraction-critical graphsHardwiger's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices ⋮ Hadwiger's conjecture for \(K_ 6\)-free graphs

Cites Work

• Unnamed Item
• Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
• 2-linked graphs
• Every planar map is four colorable
• On the structure of 5- and 6-chromatic abstract graphs.

This page was built for publication: Conjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs)