Jialu Zhu

activity

20192026

most citedArc weighted acyclic orientations and variations of degeneracy of graphs

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

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Degree-truncated choosability of graphs

Huan Zhou, Jialu Zhu, Xuding Zhu

A graph $G$ is called degree-truncated $k$ -choosable if for every list assignment $L$ with $∣ L (v) ∣ \geq min {d_{G} (v), k}$ for each vertex $v$ , $G$ is $L$ -colourable. Richter asked…

math.CO2025

Indicated list colouring game on graphs

Yangyan Gu, Yiting Jiang, Huan Zhou +2

Given a graph $G$ and a list assignment $L$ for $G$ , the indicated $L$ -colouring game on $G$ is played by two players: Ann and Ben. In each round, Ann chooses an uncoloured vertex…