Precoloring Extension. IV. General Bounds and List Colorings

Published 1 Apr 2021 in math.CO | (2104.01007v1)

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

Authors (2)

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.