Yuxue Yin

collaborators

3 papers

math.CO2018

DP-3-coloring of planar graphs without $4, 9$ -cycles and two cycles from ${5, 6, 7, 8}$

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…

math.CO2018

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 $d_{0}$ and $d_{1}$ such that planar graphs without ${4, 5}$ -cycles and $d^{Δ} \geq d_{0}$ are $3$ -choosabl…

math.CO2018

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- $3$ -colorable, which extend the corresponding results on $3$ -choosability.

DP-3-coloring of planar graphs without 4,9-cycles and two cycles from {5,6,7,8}

Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable

DP-3-coloring of some planar graphs

DP-3-coloring of planar graphs without $4, 9$ -cycles and two cycles from ${5, 6, 7, 8}$