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

Mark A. Buckingham; Martin Charles Golumbic

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

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

Mark A. Buckingham
, Martin Charles Golumbic

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

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.

Original language	English
Pages (from-to)	45-54
Number of pages	10
Journal	Discrete Mathematics
Volume	44
Issue number	1
DOIs	https://doi.org/10.1016/0012-365X(83)90005-5
State	Published - 1983
Externally published	Yes

Bibliographical note

Funding Information:
* 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.

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

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

Cite this

@article{09c84114d89948ef90c1e77d2be5bced,

title = "Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture",

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 K1,3-free graphs. Finally, we will show that the SPGC also holds for the class of circle graphs.",

author = "Buckingham, \{Mark A.\} and Golumbic, \{Martin Charles\}",

note = "Funding Information: * 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.",

year = "1983",

doi = "10.1016/0012-365X(83)90005-5",

language = "English",

volume = "44",

pages = "45--54",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

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

AU - Buckingham, Mark A.

AU - Golumbic, Martin Charles

N1 - Funding Information: * 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.

PY - 1983

Y1 - 1983

N2 - 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 K1,3-free graphs. Finally, we will show that the SPGC also holds for the class of circle graphs.

AB - 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 K1,3-free graphs. Finally, we will show that the SPGC also holds for the class of circle graphs.

UR - https://www.scopus.com/pages/publications/0041969294

U2 - 10.1016/0012-365X(83)90005-5

DO - 10.1016/0012-365X(83)90005-5

M3 - Article

AN - SCOPUS:0041969294

SN - 0012-365X

VL - 44

SP - 45

EP - 54

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

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

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this