Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs

DOI10.1016/0012-365X(89)90205-7zbMath0672.05026WikidataQ123196077 ScholiaQ123196077MaRDI QIDQ1119593

Jean Mayer

Publication date: 1989

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

zbMATH Keywords

Hadwiger's conjecture; contraction-critical graph; neighbour configurations

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Case 6 of Hadwiger's conjecture. III: The problem of 7-vertices, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Homomorphiesätze für Graphen
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• Homomorphism theorems for graphs
• Über eine Eigenschaft der ebenen Komplexe
• On the structure of 5- and 6-chromatic abstract graphs.
• Extensions of Menger's Theorem^†
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The structure of k-chromatic graphs