Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices

DOI10.1016/0012-365X(93)90174-RzbMATH Open0785.05039WikidataQ123327725 ScholiaQ123327725MaRDI QIDQ686497FDOQ686497

Authors: Jean Mayer 

Publication date: 5 April 1994

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

Recommendations

• Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
• 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)
• An abstract generalization of a map reduction theorem of Birkhoff
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• scientific article; zbMATH DE number 4132190

zbMATH Keywords

Hadwiger's conjecturecomplete graph\(k\)-chromatic graphneighbourhood subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Graph minors. IX: Disjoint crossed paths
• Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
• 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)

Cited In (8)

• Title not available (Why is that?)
• Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs
• 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)
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• A simple dissertation around the Berge problem and the Hadwiger conjecture
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Properties of 8-contraction-critical graphs with no \(K_7\) minor
• Solving \(7\times 7\) hex with domination, fill-in, and virtual connections

This page was built for publication: Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices

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