Yiting Jiang

collaborators

2 papers

math.CO2025

Degree-truncated choosability of planar graphs

Yiting Jiang, Huijuan Xu, Xinbo Xu +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

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…