Even pairs and prism corners in square-free Berge graphs

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)12-39
Number of pages28
JournalJournal of Combinatorial Theory. Series B
StatePublished - Jul 2018

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


  • Berge graphs
  • Even pairs
  • Perfect graphs
  • Prisms
  • Square-free


Dive into the research topics of 'Even pairs and prism corners in square-free Berge graphs'. Together they form a unique fingerprint.

Cite this