On approximate graph colouring and max-k-cut algorithms based on the theta-function (0)

by E de Klerk, D V Pasechnik, J P Warners
Venue:Journal of Combinatorial Optimization