Clique and chromatic number of circular-perfect graphs

13 years 11 months ago

A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr

Arnaud Pêcher, Annegret Katrin Wagler

Chromatic Number | ENDM 2010 | Perfect Graphs | Polynomial Time |

claim paper

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ENDM
Authors	Arnaud Pêcher, Annegret Katrin Wagler

Comments (0)