Sequential colorings and perfect graphs

被引:2
|
作者
Maffray, F [1 ]
Preissmann, M [1 ]
机构
[1] CNRS, Lab Leibniz, IMAG, F-38031 Grenoble, France
关键词
D O I
10.1016/S0166-218X(99)00026-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:287 / 296
页数:10
相关论文
共 50 条