16 citations · 50 across the 16 of their papers we have counts for
20 papers · 1 filter
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…
Ramsey numbers for partially-ordered sets
Christopher Cox, Derrick Stolee
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize s…
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…
On the Strong Chromatic Index of Sparse Graphs
Philip DeOrsey, Jennifer Diemunsch, Michael Ferrara +7
The strong chromatic index of a graph , denoted , is the least number of colors needed to edge-color so that edges at distance at most two receive distinct colors.…
Color-blind index in graphs of very low degree
Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6
Let be an edge-coloring of a graph , not necessarily proper. For each vertex , let , where is the number of edges incident…