共 50 条
STABILITY NUMBER AND CHROMATIC NUMBER OF TOLERANCE GRAPHS
被引:8
|作者:
NARASIMHAN, G
MANBER, R
机构:
[1] Computer Sciences Department, University of Wisconsin-Madison, Madison
基金:
美国国家科学基金会;
关键词:
D O I:
10.1016/0166-218X(92)90203-M
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Golumbic and Monma [3] introduced a subclass of perfect graphs called tolerance graphs. In this paper, we present algorithms to compute the stability number, the clique number, the chromatic number, and the clique cover number of a tolerance graph.
引用
收藏
页码:47 / 56
页数:10
相关论文