A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757)
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: A simple algorithm for 4-coloring 3-colorable planar graphs |
scientific article; zbMATH DE number 5717744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple algorithm for 4-coloring 3-colorable planar graphs |
scientific article; zbMATH DE number 5717744 |
Statements
A simple algorithm for 4-coloring 3-colorable planar graphs (English)
0 references
7 June 2010
0 references
3-colorable graph
0 references
the four color theorem
0 references
0.8976935
0 references
0.8951375
0 references
0.8864429
0 references
