Zimu Xiang

activity

20192026

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

List coloring $C_{3}$ -free planar graphs with a sparse matching of restricted lists

Stephen G. Hartke, Yupei Li, Joseph Pappe +3

A graph $G$ is $k$ -choosable if it has a proper coloring for every $k$ -list assignment. While every $C_{3}$ -free planar graph is $4$ -choosable, some of them are not $3$ -choosable, as…

math.CO2026

DP vertex-arboricity of sparse graphs

Peter Bradshaw, Alexandr Kostochka, Zimu Xiang

The vertex arboricity $va (G)$ of a multigraph $G$ is the minimum number $k$ for which $V (G)$ can be partitioned into $k$ subsets, each of which induces an acyclic subgraph…

math.CO2026

An introduction to equitable DP coloring of graphs

H. A. Kierstead, Alexandr Kostochka, Zimu Xiang

A proper $k$ -coloring of vertices of an $n$ -vertex graph is equitable if the size of every color class is $⌊ n / k ⌋$ or $⌈ n / k ⌉$ . An extension of it to list col…

List coloring C3​-free planar graphs with a sparse matching of restricted lists

DP vertex-arboricity of sparse graphs

An introduction to equitable DP coloring of graphs

List coloring $C_{3}$ -free planar graphs with a sparse matching of restricted lists