Tag Archives: Oleg Borodin

To Cheer You Up in Difficult times 24: Borodin’s colouring conjecture!

An acyclic colouring of a graph is a colouring of its vertices so that the subgraph spanned on union of every two colour classes is acyclic (a forest). Grunbaum conjectured in 1973 that Every planar graph has acyclic colouring with … Continue reading

Posted in Combinatorics | Tagged , | Leave a comment