Total coloring with Delta + poly(log Delta ) colors

Total coloring with Delta + poly(log Delta ) colors

We provide a polynomial time algorithm which finds a total coloring of any graph with maximum degree Delta , Delta sufficiently large, using at most Delta + 8 log super(8) Delta colors. This improves the best previous upper bound on the total chromatic number of Delta + 18 Delta super(1/3)log(3 Delt...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 1998-01, Vol.28 (3), p.816-821
Hauptverfasser: Hind, Hugh, Molloy, Michael, Reed, Bruce
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We provide a polynomial time algorithm which finds a total coloring of any graph with maximum degree Delta , Delta sufficiently large, using at most Delta + 8 log super(8) Delta colors. This improves the best previous upper bound on the total chromatic number of Delta + 18 Delta super(1/3)log(3 Delta ).
ISSN:0097-5397