Title of article
On the structure of self-complementary graphs
Author/Authors
Trotignon، نويسنده , , Nicolas، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
4
From page
79
To page
82
Abstract
We report on progress on polytime robust algorithms which, when applied to any graph, give as their possible outputs, a clique and colouring of the same size (which are thus a largest clique and a minimum colouring), or otherwise an easily recognizable obstruction to being in a class of perfect graphs.
Keywords
self-complementary , decomposition , graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454092
Link To Document