Xuding Zhu

activity

20062025

most citedDP-colorings of graphs with high chromatic number

42 citations · 153 across the 70 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

Multiple list colouring of planar graphs

Xuding Zhu

This paper proves that for each positive integer $m$ , there is a planar graph $G$ which is not $(4 m + ⌊ \frac{2 m - 1}{9} ⌋, m)$ -choosable. Then we pose some conjectures conce…

math.CO2016★ 1 cited

Every planar graph is $1$ -defective $(9, 2)$ -paintable

Ming Han, Xuding Zhu

Assume $L$ is a $k$ -list assignment of a graph $G$ . A $d$ -defective $m$ -fold $L$ -colouring $ϕ$ of $G$ assigns to each vertex $v$ a set $ϕ (v)$ of $m$ colours, so that $ϕ(v) \subsete…

Multiple list colouring of planar graphs

Every planar graph is 1-defective (9,2)-paintable

Every planar graph is $1$ -defective $(9, 2)$ -paintable