Fractional coloring and the odd Hadwiger's conjecture

DOI10.1016/J.EJC.2007.02.010MaRDI QIDQ2472835zbMATH OpenOpenAlexWikidataFDO

Authors Ken-ichi Kawarabayashi, Bruce 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

Hadwiger's conjecturefractional coloringfractional chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Recommendations

• Fractional colouring and Hadwiger's conjecture
• Note on coloring graphs without odd-\(K_k\)-minors
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• Some remarks on the odd Hadwiger's conjecture
• A Weakening of the Odd Hadwiger's Conjecture
• The fractional chromatic number of infinite graphs
• Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
• \(K_{s,t}\) minors in \((s+t)\)-chromatic graphs. II
• Improper colouring of graphs with no odd clique minor
• Hadwiger's conjecture

Cites work

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

Cited in

(11)

• Improved bound for improper colourings of graphs with no odd clique minor
• scientific article; zbMATH DE number 1341211 (Why is no real title available?)
• Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
• Some remarks on the odd Hadwiger's conjecture
• Fractional colouring and Hadwiger's conjecture
• Hadwiger's conjecture and topological bounds
• Hadwiger's conjecture
• Improper colourings inspired by Hadwiger's conjecture
• On topological relaxations of chromatic conjectures
• On (k,d)-colorings and fractional nowhere-zero flows
• scientific article; zbMATH DE number 1536522 (Why is no real title available?)

This page was built for publication: Fractional coloring and the odd Hadwiger's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472835)