Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514616 | Electronic Notes in Discrete Mathematics | 2005 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Kathie Cameron, Jack Edmonds,