On the complexity for constructing a 3-colouring for planar graphs with short facets (Q5213298)
From MaRDI portal
scientific article; zbMATH DE number 7161723
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity for constructing a 3-colouring for planar graphs with short facets |
scientific article; zbMATH DE number 7161723 |
Statements
On the complexity for constructing a 3-colouring for planar graphs with short facets (English)
0 references
31 January 2020
0 references
computational complexity
0 references
vertex 3-colourability problem
0 references
planar graph
0 references
