Ming Han

activity

20162023

most citedDefective 3-Paintability of Planar Graphs

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

collaborators

3 papers

math.CO2023

Weak degeneracy of planar graphs and locally planar graphs

Ming Han, Tao Wang, Jianglin Wu +2

Weak degeneracy is a variation of degeneracy which shares many nice properties of degeneracy. In particular, if a graph $G$ is weakly $d$ -degenerate, then for any $(d + 1)$ -list as…

math.CO2017★ 8 cited

Defective 3-Paintability of Planar Graphs

Grzegorz Gutowski, Ming Han, Tomasz Krawczyk +1

A $d$ -defective $k$ -painting game on a graph $G$ is played by two players: Lister and Painter. Initially, each vertex is uncolored and has $k$ tokens. In each round, Lister marks a…

math.CO2016★ 1 cited

Every planar graph is $1$ -defective $(9, 2)$ -paintable

Ming Han, Xuding Zhu

Assume $L$ is a $k$ -list assignment of a graph $G$ . A $d$ -defective $m$ -fold $L$ -colouring $ϕ$ of $G$ assigns to each vertex $v$ a set $ϕ (v)$ of $m$ colours, so that $ϕ(v) \subsete…

Weak degeneracy of planar graphs and locally planar graphs

Defective 3-Paintability of Planar Graphs

Every planar graph is 1-defective (9,2)-paintable

Every planar graph is $1$ -defective $(9, 2)$ -paintable