A short list color proof of Grotzsch's theorem

Carsten Thomassen

A short list color proof of Grotzsch's theorem

Research output: Book/Report › Report › 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 Gr\"{o}tzsch's theorem saying that everyplanar triangle-free graph is $3$-colorable.

Original language	English

Number of pages	3
Publication status	Published - 2000

OpenUrl availability

Full text

Cite this

@book{0b01206f147040e98c64fcf4fcde71be,

title = "A short list color proof of Grotzsch'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 Gr\{"}{o}tzsch's theorem saying that everyplanar triangle-free graph is $3$-colorable.",

author = "Carsten Thomassen",

year = "2000",

language = "English",

}

TY - RPRT

T1 - A short list color proof of Grotzsch's theorem

AU - Thomassen, Carsten

PY - 2000

Y1 - 2000

N2 - We give a short proof of the result that every planar graph of girth $5$is $3$-choosable and hence also of Gr\"{o}tzsch's theorem saying that everyplanar 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 Gr\"{o}tzsch's theorem saying that everyplanar triangle-free graph is $3$-colorable.

M3 - Report

BT - A short list color proof of Grotzsch's theorem

ER -