Graph Theory Seminar
Thursday, September 23, 2010 - 12:05
1 hour (actually 50 minutes)
A graph is k-choosable if it can be properly colored from any assignment of lists of colors of length at least k to its vertices. A well-known results of Thomassen state that every planar graph is 5-choosable and every planar graph of girth 5 is 3-choosable. These results are tight, as shown by constructions of Voigt. We review some new results in this area, concerning 3-choosability of planar graphs with constraints on triangles and 4-cycles.