An O(N2) algorithm for coloring perfect planar graphs (Q3323978)
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: An O(N2) algorithm for coloring perfect planar graphs |
scientific article; zbMATH DE number 3855145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(N2) algorithm for coloring perfect planar graphs |
scientific article; zbMATH DE number 3855145 |
Statements
An O(N2) algorithm for coloring perfect planar graphs (English)
0 references
1984
0 references
chromatic number
0 references
perfect planar graphs
0 references
maximal clique size
0 references
0.8846576809883118
0 references
0.8559613227844238
0 references
0.8478942513465881
0 references
