Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs (Q2798222)
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
4 April 2016
0 references
list colouring
0 references
choosability
0 references
planar graphs
0 references
maximum degree
0 references
