Fractional coloring and the odd Hadwiger's conjecture

DOI10.1016/j.ejc.2007.02.010zbMath1142.05027WikidataQ123150885 ScholiaQ123150885MaRDI QIDQ2472835

Ken-ichi Kawarabayashi, Bruce A. Reed

Publication date: 25 February 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.02.010

zbMATH Keywords

fractional chromatic number; fractional coloring; Hadwiger's conjecture

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C83: Graph minors

Related Items

Improved bound for improper colourings of graphs with no odd clique minor, On topological relaxations of chromatic conjectures, Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant, Hadwiger’s Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their average degree
• Some remarks on the odd Hadwiger's conjecture
• Note on coloring graphs without odd-\(K_k\)-minors
• A bound on the chromatic number of a graph
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• The four-colour theorem
• Fractional colouring and Hadwiger's conjecture
• The extremal function for complete minors
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• On the odd-minor variant of Hadwiger's conjecture
• An extremal function for contractions of graphs
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• 25 pretty graph colouring problems