(4,2)-choosability of planar graphs with forbidden structures

Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8

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 lis…