15 citations · 77 across the 40 of their papers we have counts for
11 papers · 1 filter
DP-4-colorability of two classes of planar graphs
Lily Chen, Runrun Liu, Gexin Yu +2
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle (2017). In this paper, we prove that every planar…
Minimum degree condition for a graph to be knitted
Runrun Liu, Martin Rolek, Gexin Yu
For a positive integer , a graph is -knitted if for each -subset of vertices, and every partition of into disjoint parts for some , one…
DP-3-coloring of planar graphs without -cycles and two cycles from
Runrun Liu, Sarah Loeb, Martin Rolek +2
A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvořák and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of c…
Strong list-chromatic index of subcubic graphs
Tianjiao Dai, Guanghui Wang, Donglei Yang +1
A strong -edge-coloring of a graph G is an edge-coloring with colors in which every color class is an induced matching. The strong chromatic index of , denoted by $χ'_{s}…
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Yuxue Yin, Gexin Yu
Montassier, Raspaud, and Wang (2006) asked to find the smallest positive integers and such that planar graphs without -cycles and are -choosabl…
Planar graphs without 4-cycles and close triangles are (2,0,0)-colorable
Heather Hoskins, Runrun Liu, Jennifer Vandenbussche +1
For a set of nonnegative integers , a -coloring of a graph is a partition of into such that for every , $…