
Borodin, Oleg V.
List Total Colouring Conjecture ★★
Author(s): Borodin; Kostochka; Woodall
Conjecture If
is the total graph of a multigraph, then
.


Keywords: list coloring; Total coloring; total graphs
Acyclic list colouring of planar graphs. ★★★
Author(s): Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena
Conjecture Every planar graph is acyclically 5-choosable.
Keywords:
The Borodin-Kostochka Conjecture ★★
Conjecture Every graph with maximum degree
has chromatic number at most
.


Keywords:
Degenerate colorings of planar graphs ★★★
Author(s): Borodin
A graph is
-degenerate if every subgraph of
has a vertex of degree
.
Conjecture Every simple planar graph has a 5-coloring so that for
, the union of any
color classes induces a
-degenerate graph.



Keywords: coloring; degenerate; planar
