Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Filling the complexity gaps for colouring planar and bounded degree graphs |
scientific article |
Statements
Filling the complexity gaps for colouring planar and bounded degree graphs (English)
0 references
17 July 2020
0 references
choosability
0 references
list colouring
0 references
maximum degree
0 references
planar graphs
0 references
