A characterization of perfect graphs

Research output: Contribution to journalArticle

226 Citations (Scopus)

Abstract

It is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.

Original languageEnglish
Pages (from-to)95-98
Number of pages4
JournalJournal of Combinatorial Theory. Series B
Volume13
Issue number2
DOIs
Publication statusPublished - 1972

Fingerprint

Perfect Graphs
Maximum Clique
Clique number
Induced Subgraph
Immediately
Complement
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A characterization of perfect graphs. / Lovász, L.

In: Journal of Combinatorial Theory. Series B, Vol. 13, No. 2, 1972, p. 95-98.

Research output: Contribution to journalArticle

@article{b0163d053c4b49b4b0fcd438b38d1bd0,
title = "A characterization of perfect graphs",
abstract = "It is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.",
author = "L. Lov{\'a}sz",
year = "1972",
doi = "10.1016/0095-8956(72)90045-7",
language = "English",
volume = "13",
pages = "95--98",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - A characterization of perfect graphs

AU - Lovász, L.

PY - 1972

Y1 - 1972

N2 - It is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.

AB - It is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.

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

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

U2 - 10.1016/0095-8956(72)90045-7

DO - 10.1016/0095-8956(72)90045-7

M3 - Article

AN - SCOPUS:0001854719

VL - 13

SP - 95

EP - 98

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -