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

7 papers · 1 filter

math.CO2015★ 2 cited

Permanent index of matrices associated with graphs

Tsai-Lien Wong, Xuding Zhu

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V (G) \cup E (G)$ a real number $f (z)$ as its weight. The vertex sum of $v$ with respect to $f$ …

math.CO2015★ 5 cited

Total weight choosability of d-degenerate graphs

Tsai-Lien Wong, Xuding Zhu

A graph $G$ is $(k, k^{'})$ -choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L (v)$ of $k$ real numbers, and assigns to each edge $e…

math.CO2015★ 3 cited

The Z-cubes: a hypercube variant with small diameter

Xuding Zhu

This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_{n}$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n - 1}$ by ad…

cs.DM2015★ 4 cited

Completing orientations of partially oriented graphs

Joergen Bang-Jensen, J. Huang, Xuding Zhu

We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partial…

math.CO2015

Anti-magic labeling of regular graphs

Feihuang Chang, Yu-Chang Liang, Zhishi Pan +1

A graph $G = (V, E)$ is antimagic if there is a one-to-one correspondence $f : E \to {1, 2, \dots, ∣ E ∣}$ such that for any two vertices $u, v$ , $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(…

math.CO2015★ 1 cited

Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \leq 2$

Min Chen, Seog-Jin Kim, Alexandr Kostochka +2

For a loopless multigraph $G$ , the fractional arboricity $A r b (G)$ is the maximum of $\frac{∣ E ( H ) ∣}{∣ V ( H ) ∣ - 1}$ over all subgraphs $H$ with at least two vertices. Generalizing the Na…