Sequential colorings and perfect graphs Original Research Article

We study a variant of a sequential algorithm for coloring the vertices of a graph, using bichromatic exchanges, and exhibit a class of graphs which have the property that there is an ordering of the vertices such that this algorithm provides an optimal coloring for each induced ordered subgraph. These graphs are perfect and generalize several well-known classes of perfect graphs such as line-graphs of bipartite graphs or triangulated graphs.