On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727)
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: On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P |
scientific article; zbMATH DE number 5664488
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P |
scientific article; zbMATH DE number 5664488 |
Statements
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (English)
0 references
29 January 2010
0 references
computational complexity
0 references
graph colorability
0 references
self-reducibility
0 references
