Abstract
An undirected graph is trivially perfect if for every induced subgraph the stability number equals the number of (maximal) cliques. We characterize the trivially perfect graphs as a proper subclass of the triangulated graphs (thus disproving a claim of Buneman [3]), and we relate them to some well-known classes of perfect graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 105-107 |
| Number of pages | 3 |
| Journal | Discrete Mathematics |
| Volume | 24 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1978 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Trivially perfect graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver