Note
Trivially perfect graphs☆

https://doi.org/10.1016/0012-365X(78)90178-4Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

☆

This research was supported in part by NSF Grant HES-75-19875.

Copyright © 1978 Published by Elsevier B.V.