7 citations · 10 across the 3 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
Choosability with union separation
Mohit Kumbhat, Kevin Moss, Derrick Stolee
List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called ch…
math.CO2015★ 7 cited
(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…