Yiting Jiang

activity

20182022

most citedGeneralized list colouring of graphs

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

collaborators

6 papers

math.CO2022

A few words about maps

Robert Cori, Yiting Jiang, Patrice Ossona de Mendez +1

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from…

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

Twin-width and generalized coloring numbers

Jan Dreier, Jakub Gajarsky, Yiting Jiang +2

In this paper, we prove that a graph $G$ with no $K_{s, s}$ -subgraph and twin-width $d$ has $r$ -admissibility and $r$ -coloring numbers bounded from above by an exponential function…

math.CO2020

Regular partitions of gentle graphs

Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez +1

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classe…

math.CO2020★ 1 cited

Generalized list colouring of graphs

Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang +4

This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.

math.CO2018

Multiple list colouring triangle-free planar graphs

Yiting Jiang, Xuding Zhu

This paper proves that for each positive integer $m$ , there is a triangle-free planar graph $G$ which is not $(3 m + ⌈ \frac{m}{17} ⌉ - 1, m)$ -choosable.