2 citations · 2 across the 7 of their papers we have counts for
7 papers
Disjoint list-colorings for planar graphs
Stijn Cambie, Wouter Cames van Batenburg, Xuding Zhu
One of Thomassen's classical results is that every planar graph of girth at least is 3-choosable. One can wonder if for a planar graph of girth sufficiently large and a …
Sparse critical graphs for defective -coloring
Alexandr Kostochka, Jingwei Xu, Xuding Zhu
A graph is -colorable if its vertices can be partitioned into subsets and so that every vertex in has degree at most and every vertex in $G[V_2]…
Weak degeneracy of planar graphs and locally planar graphs
Ming Han, Tao Wang, Jianglin Wu +2
Weak degeneracy is a variation of degeneracy which shares many nice properties of degeneracy. In particular, if a graph is weakly -degenerate, then for any -list as…
DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
Yingli Kang, Ligang Jin, Xuding Zhu
This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.
Defective acyclic colorings of planar graphs
On-Hei Solomon Lo, Ben Seamone, Xuding Zhu
This paper studies two variants of defective acyclic coloring of planar graphs. For a graph and a coloring of , a 2CC transversal is a subset of that interse…
Minimum non-chromatic--choosable graphs
Jialu Zhu, Xuding Zhu
For a multi-set of positive integers, let . A -list assignment of is a list assignment of such that the colour s…