We present a new algorithm for coloring perfect graphs and use it to c
olor the parity orderable graphs, a class which strictly contains pari
ty graphs, Also, we modify this algorithm to obtain an O(m(2) + n) loc
ally perfect coloring algorithm for parity graphs. (C) 1995 John Wiley
& Sons, Inc.