Journal ArticleOPEN ACCESS

Stability number and chromatic number of tolerance graphs

Discrete Applied Mathematics (1992) 36(1) 47-56
DOI: 10.1016/0166-218X(92)90203-M
11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 1992.

Cite

CITATION STYLE

APA

Narasimhan, G., & Manber, R. (1992). Stability number and chromatic number of tolerance graphs. Discrete Applied Mathematics, 36(1), 47–56. https://doi.org/10.1016/0166-218X(92)90203-M

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free