Jialu Zhu

activity

20242026

collaborators

5 papers

math.CO2026

Tighter Bounds on the Degree-Truncated Choice Number of Planar Graphs

Huijuan Xu, Huan Zhou, Jialu Zhu +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f : V (G) \to N$ be defined as $f (v) = min {k, d_{G} (v)}$ . If $G$ is $f$ -choosable, then we say $G$ is degree-truncated…

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…

math.CO2024

Minimum non-chromatic-choosable graphs with given chromatic number

Jialu Zhu, Xuding Zhu

A graph $G$ is called chromatic-choosable if $I ¨ (G) = c h (G)$ . A natural problem is to determine the minimum number of vertices in a $k$ -chromatic non- $k$ -choosable graph. It was conj…

math.CO2024

Arc weighted acyclic orientations and variations of degeneracy of graphs

Huan Zhou, Jialu Zhu, Xuding Zhu

This paper studies generalizations of the concept of acyclic orientations to arc-weighted orientations. These lead to four types of variations of strict degeneracy of graphs. Some…