| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653140 | Electronic Notes in Discrete Mathematics | 2006 | 8 Pages |
Abstract
In 1976 Borodin conjectured that every planar graph has a 5-coloring such that the union of every k color classes with 1⩽k⩽4 induces a k-degenerate graph. We prove the existence of such a coloring using 18 colors.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
