A short list color proof of Grötzsch's theorem

Carsten Thomassen

A short list color proof of Grötzsch's theorem

Research output: Contribution to journal › Journal article › Research › peer-review

Abstract

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.

Original language	English
Journal	Journal of Combinatorial Theory, Ser.B
Volume	88
Issue number	1
Pages (from-to)	189-192
ISSN	0095-8956
Publication status	Published - 2003

OpenUrl availability

Full text

Cite this

@article{c11c0e850353408c91c86c50a627c02a,

title = "A short list color proof of Gr{\"o}tzsch's theorem",

abstract = "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.",

author = "Carsten Thomassen",

year = "2003",

language = "English",

volume = "88",

pages = "189--192",

journal = "Journal of Combinatorial Theory, Ser.B",

issn = "0095-8956",

publisher = "Academic Press",

number = "1",

}

TY - JOUR

T1 - A short list color proof of Grötzsch's theorem

AU - Thomassen, Carsten

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

M3 - Journal article

SN - 0095-8956

VL - 88

SP - 189

EP - 192

JO - Journal of Combinatorial Theory, Ser.B

JF - Journal of Combinatorial Theory, Ser.B

IS - 1

ER -

A short list color proof of Grötzsch's theorem

Abstract

OpenUrl availability

Fingerprint

Cite this