Stability number and chromatic number of tolerance graphs

Stability number and chromatic number of tolerance graphs

0.00 Avg rating—0 Votes
Article ID: iaor19921846
Country: Netherlands
Volume: 36
Issue: 1
Start Page Number: 47
End Page Number: 56
Publication Date: Mar 1992
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

Golumbic and Monma introduced a subclass of perfect graphs called tolerance graphs. In this paper, the authors present algorithms to compute the stability number, the clique number, the chromatic number, and the clique cover number of a tolerance graph.

Reviews

Required fields are marked *. Your email address will not be published.