7 citations · 8 across the 4 of their papers we have counts for
3 papers · 2 filters
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…
(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…
I,F-partitions of Sparse Graphs
Axel Brandt, Michael Ferrara, Mohit Kumbhat +3
A star -coloring is a proper -coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-c…