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 2012Show all

2 papers · 1 filter

math.CO2012

Circular flow number of highly edge connected signed graphs

Xuding Zhu

This paper proves that for any positive integer $k$ , every essentially $(2 k + 1)$ -unbalanced $(12 k - 1)$ -edge connected signed graph has circular flow number at most $2 + \frac{1}{k}$ .

math.CO2012★ 2 cited

Nonrepetitive colorings of lexicographic product of graphs

Balázs Keszegh, Balázs Patkós, Xuding Zhu

A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_{1} v_{2} \dots v_{2 l}$ for which $c (v_{i}) = c (v_{l + i})$ for all $1 \leq i \leq l$ . Given graphs $G$ a…