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.
机构:
Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia
Univ Maribor, Fac Nat Sci & Math, Maribor, Slovenia
Inst Math Phys & Mech, Ljubljana, SloveniaSharif Univ Technol, Dept Math Sci, Tehran, Iran