Δ-List vertex coloring in linear time

Authors:
San Skulrattanakulchai
Affiliations:
Department of Mathematics and Computer Science, Gustavus Adolphus College, Saint Peter, MN 56082-1498, USA
Venue:
Information Processing Letters
Year:
2006

Citing 2
Cited 1

Path-based depth-first search for strong and biconnected components

Information Processing Letters
Introduction to Algorithms

Introduction to Algorithms

Time optimal d-list colouring of a graph

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give a new proof of a theorem of Erdos, Rubin, and Taylor. Our proof yields the first linear time algorithm to @D-list-color any graph containing no (@D+1)-clique, and containing no odd cycle if @D=2. Without change, our algorithm can also be used to @D-color such graphs. It has the same resource bound as, but is simpler than, the current known algorithm of Lovasz for @D-coloring such graphs.