Name
Abstract | ||
|---|---|---|
A well known conjecture of Hadwiger asserts that K\"n\"+\"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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2007.12.017 | Discrete Mathematics |
Keywords | Field | DocType |
hadwiger’s conjecture,minor minimal graps,chromatic index,hadwiger's conjecture,indexation | Discrete mathematics,Edge coloring,Graph,Combinatorics,Chromatic scale,Hadwiger's theorem,Lonely runner conjecture,Hadwiger conjecture (combinatorial geometry),Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
309 | 5 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Ding | 1 | 444 | 51.58 |