Hadwiger's conjecture for circular colorings of edge-weighted graphs

DOI10.1016/j.disc.2005.09.032zbMath1119.05044OpenAlexW2001779751WikidataQ122872446 ScholiaQ122872446MaRDI QIDQ864127

Gašper Fijavž

Publication date: 13 February 2007

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

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

zbMATH Keywords

edge-weighted graphHadwiger's conjecturecircular coloringedge-weighted minor

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Hajós theorem for colorings of edge-weighted graphs
• Über eine Eigenschaft der ebenen Komplexe
• Every planar map is four colorable
• Circular colorings of edge-weighted graphs
• Circular chromatic number: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hadwiger's conjecture for circular colorings of edge-weighted graphs