By Daniel Gonçalves and others

Brooks' Theorem is a fundamental result on graph colouring, stating that the chromatic number of a graph is almost always upper bounded by its maximal degree. Lov\'asz showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)graph... Show more

May 8, 2024

Loading full text...

Similar articles

Loading recommendations...

x1

Brooks-type colourings of digraphs in linear time

Click on play to start listening