Fon-Der-Flasss, D. G.
Acyclic list colouring of planar graphs. ★★★
Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena
Conjecture Every planar graph is acyclically 5-choosable.
Keywords:
Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena
Keywords: