Yan Gu

activity

20212025

most citedThe Alon-Tarsi number of planar graphs -- a simple proof

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

collaborators

Showing math.COShow all

4 papers · 1 filter

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.CO2022

Refined list version of Hadwiger's conjecture

Yangyan Gu, Yiting Jiang, David R. Wood +1

Assume $λ = {k_{1}, k_{2}, \dots, k_{q}}$ is a partition of $k_{λ} = \sum_{i = 1}^{q} k_{i}$ . A $λ$ -list assignment of $G$ is a $k_{λ}$ -list assignment $L$ of $G$ such that the colour set $\bigcup…

math.CO2022★ 1 cited

The Alon-Tarsi number of planar graphs -- a simple proof

Yangyan Gu, Xuding Zhu

This paper gives a simple proof of the result that every planar graph $G$ has Alon-Tarsi number at most 5, and has a matching $M$ such that $G - M$ has Alon-Tarsi number at most 4.

math.CO2021

Girth and $λ$ -choosability of graphs

Yangyan Gu, Xuding Zhu

Assume $k$ is a positive integer, $λ = {k_{1}, k_{2}, ..., k_{q}}$ is a partition of $k$ and $G$ is a graph. A $λ$ -assignment of $G$ is a $k$ -assignment $L$ of $G$ such that…

Indicated list colouring game on graphs

Refined list version of Hadwiger's conjecture

The Alon-Tarsi number of planar graphs -- a simple proof

Girth and λ-choosability of graphs

Girth and $λ$ -choosability of graphs