Search
Now showing items 1-1 of 1
On list k-coloring convex bipartite graphs
(Springer Nature, 2021)
List k-Coloring (Lik-Col) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1, 2, …, k}. The problem is known to be NP-hard ...