Brooks-type colourings of digraphs in linear time

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ász showed that such a colouring may then be computed in linear time when it exists. Many analogues are known for variants of (di)gra...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-05
Hauptverfasser:	Gonçalves, Daniel, Lucas Picasarri-Arrieta, Amadeus Reinald
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Graph coloring Graph theory Theorems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!