Stability number and chromatic number of tolerance graphs
暂无分享，去创建一个
Abstract 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.
[1] András Frank,et al. On chain and antichain families of a partially ordered set , 1980, J. Comb. Theory, Ser. B.
[2] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[3] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[4] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..