# Noon lecture

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)

On 18.7.2013 at 12:20 in S6, there is the following noon lecture:

# (3,1)^{*}-choosability of planar graphs

## Min Chen

## Abstract

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

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)

Webmaster: kamweb.mff.cuni.cz Archive page