On linear-time algorithms for five-coloring planar graphs (Q1057278): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(84)90056-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028550759 / rank | |||
Normal rank | |||
Revision as of 08:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On linear-time algorithms for five-coloring planar graphs |
scientific article |
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
