4 citations · 5 across the 6 of their papers we have counts for
6 papers
Every toroidal graphs without adjacent triangles is odd 8-colorable
Fangyu Tian, Yuxue Yin
Odd coloring is a proper coloring with an additional restriction that every non-isolated vertex has some color that appears an odd number of times in its neighborhood. The minimum…
Every toroidal graph without -cycles is odd -colorable
Fangyu Tian, Yuxue Yin
Odd coloring is a proper coloring with an additional restriction that every non-isolated vertex has some color that appears an odd number of times in its neighborhood. The minimum…
The odd chromatic number of a toroidal graph is at most 9
Fangyu Tian, Yuxue Yin
It's well known that every planar graph is -colorable. A toroidal graph is a graph that can be embedded on a torus. It's proved that every toroidal graph is -colorable. A pro…
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…
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…
DP-3-coloring of some planar graphs
Runrun Liu, Sarah Loeb, Yuxue Yin +1
In this article, we use a unified approach to prove several classes of planar graphs are DP--colorable, which extend the corresponding results on -choosability.