Heuristic for rapidly four-coloring large planar graphs (Q1180542)
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: Heuristic for rapidly four-coloring large planar graphs |
scientific article; zbMATH DE number 26008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic for rapidly four-coloring large planar graphs |
scientific article; zbMATH DE number 26008 |
Statements
Heuristic for rapidly four-coloring large planar graphs (English)
0 references
27 June 1992
0 references
four-coloring
0 references
planar graphs
0 references
Kempe chaining
0 references
saturation algorithm of Brélaz
0 references
