On linear-time algorithms for five-coloring planar graphs (Q1057278)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On linear-time algorithms for five-coloring planar graphs |
scientific article; zbMATH DE number 3896957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On linear-time algorithms for five-coloring planar graphs |
scientific article; zbMATH DE number 3896957 |
Statements
On linear-time algorithms for five-coloring planar graphs (English)
0 references
1984
0 references
This paper presents clarifying proofs of two linear time algorithms for 5-coloring a planar graph. The paper begins with the false statement that 4-coloring a planar graph can be done in \(O(n^ 2)\) time - planar 4- coloring is NP-complete even when all vertices have degree 3.
0 references
linear time algorithms
0 references
5-coloring
0 references
planar graph
0 references
