A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:42, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple algorithm for 4-coloring 3-colorable planar graphs |
scientific article |
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