Colouring graphs with no induced six-vertex path or diamond (Q5925590)
From MaRDI portal
scientific article; zbMATH DE number 7638364
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Colouring graphs with no induced six-vertex path or diamond |
scientific article; zbMATH DE number 7638364 |
Statements
Colouring graphs with no induced six-vertex path or diamond (English)
0 references
4 January 2023
0 references
graph colouring
0 references
\(\chi\)-boundedness
0 references
strong perfect graph theorem
0 references
Lovász theta function
0 references
polynomial-time algorithms
0 references
