Computing clique and chromatic number of circular-perfect graphs in polynomial time

Arnaud Pêcher, Annegret Katrin Wagler. Computing clique and chromatic number of circular-perfect graphs in polynomial time. Math. Program., 141(1-2):121-133, 2013. [doi]

Authors

Arnaud Pêcher

This author has not been identified. Look up 'Arnaud Pêcher' in Google

Annegret Katrin Wagler

This author has not been identified. Look up 'Annegret Katrin Wagler' in Google