| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903845 | Journal of Combinatorial Theory, Series B | 2018 | 28 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maria Chudnovsky, Frédéric Maffray, Paul Seymour, Sophie Spirkl,