| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657272 | Journal of Combinatorial Theory, Series B | 2008 | 12 Pages |
Abstract
We prove that, for every list-assignment of two colors to every vertex of any planar graph, there is a list-coloring such that there is no monochromatic triangle. This proves and extends a conjecture of B. Mohar and R. Škrekovski and a related conjecture of A. Kündgen and R. Ramamurthi.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
