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

DOI10.1016/0012-365X(93)90174-RzbMath0785.05039WikidataQ123327725 ScholiaQ123327725MaRDI QIDQ686497

Jean Mayer

Publication date: 5 April 1994

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

zbMATH Keywords

complete graphHadwiger's conjecture\(k\)-chromatic graphneighbourhood subgraph

Mathematics Subject Classification ID

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

Related Items (1)

A simple dissertation around the Berge problem and the Hadwiger conjecture

Cites Work

• Unnamed Item
• 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)
• Graph minors. IX: Disjoint crossed paths

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