Document Type
Article
Publication Date
3-28-2009
Abstract
A well known conjecture of Hadwiger asserts that Kn + 1 is the only minor minimal graph of chromatic number greater than n. In this paper, all minor minimal graphs of chromatic index greater than n are determined. © 2008 Elsevier B.V. All rights reserved.
Publication Source (Journal or Book title)
Discrete Mathematics
First Page
1118
Last Page
1122
Recommended Citation
Ding, G. (2009). The edge version of Hadwiger's conjecture. Discrete Mathematics, 309 (5), 1118-1122. https://doi.org/10.1016/j.disc.2007.12.017
COinS
