Fractional colouring and Hadwiger's conjecture

DOI10.1006/jctb.1998.1835zbMath1029.05060OpenAlexW2010687445MaRDI QIDQ1569032

Bruce A. Reed, P. D. Seymour

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6bb342b7c284f036b2c2856cedb613a82367ffbd

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

On the Hadwiger's conjecture for graph products ⋮ Some recent progress and applications in graph minor theory ⋮ Strong chromatic index and Hadwiger number ⋮ Local Hadwiger's conjecture ⋮ Refined List Version of Hadwiger’s Conjecture ⋮ Recent progress towards Hadwiger's conjecture ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ Parameters Tied to Treewidth ⋮ Some remarks on the odd Hadwiger's conjecture ⋮ Fractional coloring and the odd Hadwiger's conjecture ⋮ On topological relaxations of chromatic conjectures ⋮ On tree-partition-width ⋮ Hadwiger’s Conjecture ⋮ Linear connectivity forces large complete bipartite minors ⋮ Clique minors in graphs and their complements ⋮ Connectivity and choosability of graphs with no \(K_t\) minor

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An extremal function for contractions of graphs
• On Hadwiger's Number and the Stability Number

This page was built for publication: Fractional colouring and Hadwiger's conjecture