| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652971 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree Δ⩾8 is at most . We show that it is at most , and indeed this is true for the list chromatic number.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
