Multiple list colouring of planar graphs
classification
🧮 math.CO
keywords
planarcolouringgraphslistmultiplechoosableconcerningconjectures
read the original abstract
This paper proves that for each positive integer $m$, there is a planar graph $G$ which is not $(4m+\lfloor \frac{2m-1}{9}\rfloor,m)$-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.