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.
Original language | English (US) |
---|---|
Pages (from-to) | 12-39 |
Number of pages | 28 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 131 |
DOIs | |
State | Published - Jul 2018 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Keywords
- Berge graphs
- Even pairs
- Perfect graphs
- Prisms
- Square-free