Multiple list colouring of planar graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.