A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A better upper bound on the chromatic number of (cap, even-hole)-free graphs |
scientific article |
Statements
A better upper bound on the chromatic number of (cap, even-hole)-free graphs (English)
0 references
6 September 2021
0 references
(cap, even-hole)-free graphs
0 references
chromatic number
0 references
clique number
0 references
0 references