The Alon-Tarsi number of a planar graph minus a matching von Grytczuk, Jarosław, Zhu, Xuding

Volltext

Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles von Zhou, Huan, Zhu, Xuding

Volltext

2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs von West, Douglas B., Zhu, Xuding

Volltext

Game coloring the Cartesian product of graphs von Zhu, Xuding

Volltext

The Alon–Tarsi number of planar graphs von Zhu, Xuding

Volltext

Approximating Maximum Lifetime k -Coverage Through Minimizing Weighted k -Cover in Homogeneous Wireless Sensor Networks von Zhao Zhang, Willson, James, Zaixin Lu, Weili Wu, Xuding Zhu, Ding-Zhu Du

Volltext

List 4-colouring of planar graphs von Zhu, Xuding

Volltext

A refinement of choosability of graphs von Zhu, Xuding

Volltext

Every nice graph is (1,5)-choosable von Zhu, Xuding

Volltext

Rainbow domination on trees von Chang, Gerard J., Wu, Jiaojiao, Zhu, Xuding

Volltext

Relatively small counterexamples to Hedetniemi's conjecture von Zhu, Xuding

Volltext

Colouring graphs with bounded generalized colouring number von Zhu, Xuding

Volltext

The circular chromatic number of signed series–parallel graphs of given girth von Zhu, Jialu, Zhu, Xuding

Volltext

A Note on the Poljak-Rödl Function von Zhu, Xuding

Volltext

Generalized List Colouring of Graphs von Cho, Eun-Kyung, Choi, Ilkyoo, Jiang, Yiting, Kim, Ringi, Park, Boram, Yan, Jiayan, Zhu, Xuding

Volltext

Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices von Zhu, Jialu, Zhu, Xuding

Volltext

Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2 k + 2 $2k+2$‐vertices von Zhu, Jialu, Zhu, Xuding

Volltext

Multiple list colouring of planar graphs von Zhu, Xuding

Volltext

Odd 4-Coloring of Outerplanar Graphs von Kashima, Masaki, Zhu, Xuding

Volltext

Total coloring of planar graphs of maximum degree eight von Roussel, Nicolas, Zhu, Xuding

Volltext