Document Type

Article

Publication Date

1989

DOI

10.1016/0095-8956(89)90019-1

Publication Title

Journal of Combinatorial Theory, Series B

Volume

47

Issue

2

Pages

187-191

Abstract

A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the largest number ω(F) of pairwise adjacent vertices in F. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement G contains an odd chordless cycle of length at least five. Its resolution has eluded researchers for more than twenty years. We prove that the conjecture is true for a class of graphs which strictly contains the claw-free graphs.

Comments

Elsevier open archive. Copyright © 1989 Published by Elsevier Inc. All rights reserved.

Original Publication Citation

Olariu, S. (1989). The strong perfect graph conjecture for pan-free graphs. Journal of Combinatorial Theory, Series B, 47(2), 187-191. doi:10.1016/0095-8956(89)90019-1

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS