A heuristic for the coloring of planar graphs (Q2133446)
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 heuristic for the coloring of planar graphs |
scientific article; zbMATH DE number 7516362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for the coloring of planar graphs |
scientific article; zbMATH DE number 7516362 |
Statements
A heuristic for the coloring of planar graphs (English)
0 references
29 April 2022
0 references
3-coloring graph
0 references
maximal independent set
0 references
planar graphs
0 references
independent paths
0 references
