Sopena, Eric

Graph Theory » Coloring » Vertex coloring

Acyclic list colouring of planar graphs. ★★★

Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena

Conjecture Every planar graph is acyclically 5-choosable.

Keywords:

Posted by fhavet
updated March 7th, 2013

add new comment