Extending partial colorings of graphs Original Research Article

Recently, several authors have considered the problem of extending a partial coloring of a graph to a complete coloring. We show how similar results can be extracted from old proofs on recursive colorings of highly recursive graphs.