Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture

doi:10.1016/0012-365X(83)90005-5

Discrete Mathematics

Volume 44, Issue 1, 1983, Pages 45-54

https://doi.org/10.1016/0012-365X(83)90005-5 Get rights and content

Under an Elsevier user license

open archive

Abstract

Partitionable graphs have been studied by a number of authors in conjunction with attempts at proving the Berge Strong Perfect Graph Conjecture (SPGC). We give some new properties of partitionable graphs which can be used to give a new proof that the SPGC holds for K_1,3-free graphs. Finally, we will show that the SPGC also holds for the class of circle graphs.

Cited by (0)

^☆: The research for this paper was supported in part by the National Science Foundation under Grant No. MCS78-03820.

^∗∗: Current affiliation: Arthur Andersen & Co., New York, NY 10105, USA.

^∗∗∗: Current affiliation: I.B.M. Israel Scientific Center, Technion City, Haifa, Israel.

Discrete Mathematics

Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture☆

Abstract