A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A note on the Cornaz–Jost transformation to solve the graph coloring problem
2013
Information Processing Letters
In this note, we use a reduction by Cornaz and Jost from the graph (max-)coloring problem to the maximum (weighted) stable set problem in order to characterize new graph classes where the graph coloring problem and the more general max-coloring problem can be solved in polynomial time.
doi:10.1016/j.ipl.2013.05.014
fatcat:xhfsquekyfhrdkeactdhkqn56a