Trivially perfect graphs

Martin Charles Golumbic

doi:10.1016/0012-365X(78)90178-4

Trivially perfect graphs

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1016/0012-365X(78)90178-4
State	Published - 1978
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(78)90178-4

Cite this

@article{9bc7465848f2460faee3fcaacec26542,

title = "Trivially perfect graphs",

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.",

author = "Golumbic, {Martin Charles}",

year = "1978",

doi = "10.1016/0012-365X(78)90178-4",

language = "English",

volume = "24",

pages = "105--107",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Trivially perfect graphs

AU - Golumbic, Martin Charles

PY - 1978

Y1 - 1978

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0013525226&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(78)90178-4

DO - 10.1016/0012-365X(78)90178-4

M3 - Article

AN - SCOPUS:0013525226

SN - 0012-365X

VL - 24

SP - 105

EP - 107

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Trivially perfect graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this