![](/files/happy5.png)
Sopena, Eric
Acyclic list colouring of planar graphs. ★★★
Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena
Conjecture Every planar graph is acyclically 5-choosable.
Keywords:
![Syndicate content Syndicate content](/misc/feed.png)
Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena
Keywords: