Add a description, image, and links to the graph-coloring-problem topic page so that developers can more easily learn about it.

Abstract: In recent years, the advantages of Graph Neural Networks (GNNs) in solving complex combinatorial optimization problems have become more and more obvious. Under this background, this paper ...

Abstract: Two major milestones on the road to the full complexity dichotomy for finite-domain constraint satisfaction problems were Bulatov’s proof of the dichotomy for conservative templates, and the ...