Title of article
2-List-coloring planar graphs without monochromatic triangles
Author/Authors
Thomassen، نويسنده , , Carsten، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
12
From page
1337
To page
1348
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.
Keywords
List colorings
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series B
Record number
1528773
Link To Document