Title of article
A short list color proof of Grِtzschʹs theorem
Author/Authors
Thomassen، نويسنده , , Carsten، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
4
From page
189
To page
192
Abstract
We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grِtzschʹs theorem saying that every planar triangle-free graph is 3-colorable.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series B
Record number
1527229
Link To Document