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

6 papers · 1 filter

math.CO2018★ 9 cited

The Alon-Tarsi number of a planar graph minus a matching

Jarosław Grytczuk, Xuding Zhu

This paper proves that every planar graph $G$ contains a matching $M$ such that the Alon-Tarsi number of $G - M$ is at most $4$ . As a consequence, $G - M$ is $4$ -paintable, and hence $…

math.CO2018★ 1 cited

A refinement of choosability of graphs

Xuding Zhu

Assume $k$ is a positive integer, $λ = {k_{1}, k_{2}, \dots, k_{q}}$ is a partition of $k$ and $G$ is a graph. A $λ$ -list assignment of $G$ is a $k$ -list assignment $L$ of $G$ such that…

math.CO2018★ 4 cited

Colouring of generalized signed planar graphs

Ligang Jin, Tsai-Lien Wong, Xuding Zhu

Assume $G$ is a graph. We view $G$ as a symmetric digraph, in which each edge $uv$ of $G$ is replaced by a pair of opposite arcs $e = (u, v)$ and $e^{- 1} = (v, u)$ . Assume $S$ is an inve…

math.CO2018

Multiple list colouring triangle-free planar graphs

Yiting Jiang, Xuding Zhu

This paper proves that for each positive integer $m$ , there is a triangle-free planar graph $G$ which is not $(3 m + ⌈ \frac{m}{17} ⌉ - 1, m)$ -choosable.

math.CO2018★ 1 cited

Fractional DP-Colorings of Sparse Graphs

Anton Bernshteyn, Alexandr Kostochka, Xuding Zhu

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. In this paper we introduce and study the fractiona…

math.CO2018

The Slow-coloring Game on Sparse Graphs: $k$ -Degenerate, Planar, and Outerplanar

Grzegorz Gutowski, Tomasz Krawczyk, Krzysztof Maziarz +3

The \emph{slow-coloring game} is played by Lister and Painter on a graph $G$ . Initially, all vertices of $G$ are uncolored. In each round, Lister marks a nonempty set $M$ of uncolo…