Precoloring Extension. IV. General Bounds and List Colorings
arXiv:2104.01007
Abstract
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
arXiv:2104.01007
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.