Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information
Date and Time: Wednesday, December 12, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Anna Hanulová
We give a short proof of the result that every planar graph of girth 5 is 3-choosable and hence also Grötzsch's theorem saying that every planar triangle-free graph is 3-colorable.
Automatic MiSe System Software Version 1.4803M | admin login