Abstract
Let G be a Berge graph that has no odd prism and no antihole of length at least six as an induced subgraph. We show that every such graph G with no balanced skew-partition is either complete or has an even pair.
| Original language | English (US) |
|---|---|
| Article number | 114388 |
| Journal | Discrete Mathematics |
| Volume | 348 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2025 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Keywords
- Berge graphs
- Coloring
- Even pairs
- Induced subgraphs
Fingerprint
Dive into the research topics of 'Even pairs in Berge graphs with no balanced skew-partitions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver