Title of article
Clique and chromatic number of circular-perfect graphs
Author/Authors
Pêcher، نويسنده , , Arnaud and Wagler، نويسنده , , Annegret K.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
199
To page
206
Abstract
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Grِtschel, Lovلsz and Schrijver 1981). Circular-perfect graphs form a well-studied superclass of perfect graphs. We extend the above result for perfect graphs by showing that clique and chromatic number of a circular-perfect graph are computable in polynomial time as well. The results strongly rely upon Lovلszʹs Theta function.
Keywords
circular-perfect graph , Polytope , circular-clique
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455383
Link To Document