Title of article
Colouring Some Classes of Perfect Graphs Robustly
Author/Authors
Cameron، نويسنده , , Kathie and Edmonds، نويسنده , , Jack، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
4
From page
553
To page
556
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
Intersection graph , existentially polytime theorem , Perfect graph , graph colouring , Meyniel graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454237
Link To Document