pancreas 发表于 2025-4-1 02:35:01
https://doi.org/10.1007/978-1-4471-2053-7lists of length 2, a well known polynomial problem in general). We then show that given any instance of the list colouring problem restricted to lists having the same length ., a solution exists and can be polynomially computed from any .-colouring of the graph, provided that the overall number of available colours does not exceed ..带来墨水 发表于 2025-4-1 10:05:34
http://reply.papertrans.cn/89/8817/881676/881676_62.png