| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777679 | Journal of Combinatorial Theory, Series B | 2017 | 6 Pages |
Abstract
This paper proves that for each positive integer m, there is a planar graph G which is not (4m+â2mâ19â,m)-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Xuding Zhu,