### (4, 2)-Choosability of Planar Graphs with Forbidden Structures

Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee
2017 Graphs and Combinatorics
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any ℓ∈{3,4,5,6,7}, a planar graph is 4-choosable if it is ℓ-cycle-free. In terms of constraining the list assignment, one refinement of k-choosability is choosability with separation. A graph is (k,s)-choosable
more » ... if the graph is colorable from lists of size k where adjacent vertices have at most s common colors in their lists. Every planar graph is (4,1)-choosable, but there exist planar graphs that are not (4,3)-choosable. It is an open question whether planar graphs are always (4,2)-choosable. A chorded ℓ-cycle is an ℓ-cycle with one additional edge. We demonstrate for each ℓ∈{5,6,7} that a planar graph is (4,2)-choosable if it does not contain chorded ℓ-cycles.