Top

Xiangwen Li

Every planar graph without adjacent cycles of length at most 8 is 3-choosable.

Date: 4/26/2018
Time: 3:30PM-4:30PM
Place: 315 Armstrong Hall

Abstract: DP-coloring as a generation of list coloring was introduced by Dvovrak and Postle in 2017,
who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which was conjectured by Brodian et al. in 2007. In this paper, we prove that every planar graph without adjacent cycles of length at most 8 is 3-choosable, which extends this result of Dvovrak and Postle.

This talk will be accessible to graduate students.

Xiangwen Li

All are welcome.

Date, Location: 
2018-04-26