Precoloring Extension. IV. General Bounds and List Colorings

Abstract

A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.