On 18.07.2013 at 12:20 in S6, there is the following noon lecture:
(3,1)*-choosability of planar graphs
(joint work with Andre Raspaud and Weifan Wang)
In this talk, firstly, I will show some known results on improper list coloring of (planar) graphs with some restrictions. Then, I will give a short proof of our recent result: every planar graph without adjacent triangles and 6-cycles is (3,1)*-choosable. This partially answers the question proposed by Xu that every planar graphs without adjacent triangles is (3,1)*-choosable.
Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010