| Titel:
|
A short list color proof of Grötzsch's theorem |
| Type:
|
Journal articleJournal article |
| Person(er):
|
Technical University of Denmark
Email:
|
| Uddrag:
|
We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also of Grotzsch's theorem saying that every planar triangle-free graph is 3-colorable. |
| Publiceret:
|
in journal: Journal of Combinatorial Theory, Ser.B (ISSN: 0095-8956), vol: 88, issue: 1, pages: 189-192, 2003 |
|