On linear-time algorithms for five-coloring planar graphs (Q1057278): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Every planar map is four colorable. I: Discharging / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear 5-coloring algorithm of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A batching method for coloring planar graphs / rank | |||
Normal rank | |||
Latest revision as of 16:29, 14 June 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
