We present a new algorithm for coloring perfect graphs and use it to color the parity orderable graphs, a class which strictly contains parity graphs, Also, we modify this algorithm to obtain an O(m(2) + n) locally perfect coloring algorithm for parity graphs. (C) 1995 John Wiley & Sons, Inc. [References: 12]
展开▼
机译：我们提出了一种用于着色完美图形的新算法，并将其用于对奇偶可排序图进行着色，该类严格包含奇偶校验图。此外，我们对该算法进行了修改，以获取O（m（2）+ n）局部完美着色算法奇偶校验图。 （C）1995 John Wiley＆Sons，Inc. [参考：12]
展开▼
