Name
Abstract | ||
|---|---|---|
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree Δ⩾8 is at most ⌈32Δ⌉+1. We show that it is at most 32Δ(1+o(1)), and indeed this is true for the list chromatic number. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.endm.2007.07.079 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
list colouring,planar graph,square of a graph | Wheel graph,Discrete mathematics,Outerplanar graph,Combinatorics,Graph power,List coloring,Book embedding,Degree (graph theory),Friendship graph,Windmill graph,Mathematics | Journal |
Volume | ISSN | Citations |
29 | 1571-0653 | 23 |
PageRank | References | Authors |
1.25 | 18 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédéric Havet | 1 | 433 | 55.15 |
| Jan van den Heuvel | 2 | 361 | 34.75 |
| Colin McDiarmid | 3 | 1071 | 167.05 |
| Bruce Reed | 4 | 305 | 16.94 |