Colouring Some Classes of Perfect Graphs Robustly

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.