Xin Zhang

activity

20242026

most citedEquitable coloring of sparse graphs

1 citations · 1 across the 11 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

math.CO2024★ 1 cited

Equitable coloring of sparse graphs

Weichan Liu, Xin Zhang

An equitable coloring of a graph is a proper coloring where the sizes of any two distinct color classes differ by at most one. The celebrated Chen-Lih-Wu Conjecture (CLWC for short…

math.CO2024

Cooperative colorings of hypergraphs

Xuqing Bai, Bi Li, Weichan Liu +1

Given a class $H$ of $m$ hypergraphs $H_{1}, H_{2}, \dots, H_{m}$ with the same vertex set $V$ , a cooperative coloring of them is a partition ${I_{1}, I_{2}, \dots, I_{m}}$ …

math.CO2024

Every subcubic graph is packing $(1, 1, 2, 2, 3)$ -colorable

Xujun Liu, Xin Zhang, Yanting Zhang

For a sequence $S = (s_{1}, \dots, s_{k})$ of non-decreasing integers, a packing $S$ -coloring of a graph $G$ is a partition of its vertex set $V (G)$ into $V_{1}, \dots, V_{k}$ such that fo…

Equitable coloring of sparse graphs

Cooperative colorings of hypergraphs

Every subcubic graph is packing (1,1,2,2,3)-colorable

Every subcubic graph is packing $(1, 1, 2, 2, 3)$ -colorable