The edge version of Hadwiger's conjecture

DOI10.1016/j.disc.2007.12.017zbMath1193.05074OpenAlexW1990663220WikidataQ123166402 ScholiaQ123166402MaRDI QIDQ1011784

Guoli Ding

Publication date: 9 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.017

zbMATH Keywords

chromatic indexHadwiger's conjectureminor minimal graps

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Hadwiger's conjecture for \(K_ 6\)-free graphs
• The four-colour theorem
• Über eine Eigenschaft der ebenen Komplexe
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Every planar map is four colorable
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The edge version of Hadwiger's conjecture