An O(N2) algorithm for coloring perfect planar graphs (Q3323978)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(N2) algorithm for coloring perfect planar graphs |
scientific article |
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
