Multiple list colouring of planar graphs

preprint2016arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Multiple list colouring of planar graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0