Disproof of the group coloring version of the Hadwiger conjecture

DOI10.1142/S1793830914500359MaRDI QIDQ2920883zbMATH OpenWikidataFDO

Authors Baoyindureng Wu, Xinhui An

Publication date 29 September 2014

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

group connectivitygroup coloringHadwiger conjecturegroup chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Disproof of the list Hadwiger conjecture
• Hadwiger's conjecture
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• An approximate version of Hadwiger's conjecture for claw-free graphs
• Improved lower bound for the list chromatic number of graphs with no K_t minor

Cites work

• A note on group colorings
• A relaxed Hadwiger's conjecture for list colorings
• An inequality for the group chromatic number of a graph
• Contractibility and the Hadwiger conjecture
• Group chromatic number of graphs without \(K_5\)-minors
• Group chromatic number of planar graphs of girth at least 4
• Group connectivity and group colorings of graphs --- a survey
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties

Cited in

(1)

• Disproof of the list Hadwiger conjecture

This page was built for publication: Disproof of the group coloring version of the Hadwiger conjecture

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