Even pairs and prism corners in square-free Berge graphs

Loading...
Thumbnail Image

Date

2018-07

Authors

Chudnovsky, Maria
Maffray, Frédéric
Seymour, Paul
Spirkl, Sophie

Advisor

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Abstract

Let G be a Berge graph such that no induced subgraph is a 4-cycle or a line-graph of a bipartite subdivision of K4. We show that every such graph G either is a complete graph or has an even pair.

Description

The final publication is available at Elsevier via https://doi.org/10.1016/j.jctb.2018.01.003 © 2018.. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/

Keywords

perfect graphs, berge graphs, square-free, prisms, even pairs

LC Keywords

Citation