A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.02.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109639734 / rank | |||
Normal rank | |||
Revision as of 03:43, 20 March 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
