Stability number and chromatic number of tolerance graphs (Q1186162)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stability number and chromatic number of tolerance graphs |
scientific article; zbMATH DE number 36293
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability number and chromatic number of tolerance graphs |
scientific article; zbMATH DE number 36293 |
Statements
Stability number and chromatic number of tolerance graphs (English)
0 references
28 June 1992
0 references
The authors present algorithms to compute the stability number, the clique number, the chromatic number, and the clique cover of a subclass of perfect graphs, called tolerance graphs, introduced by Golumbic and Monma.
0 references
stability number
0 references
clique number
0 references
chromatic number
0 references
clique cover
0 references
perfect graphs
0 references
tolerance graphs
0 references
