On unique graph 3-colorability and parsimonious reductions in the plane (Q596079)
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 unique graph 3-colorability and parsimonious reductions in the plane |
scientific article; zbMATH DE number 2085502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On unique graph 3-colorability and parsimonious reductions in the plane |
scientific article; zbMATH DE number 2085502 |
Statements
On unique graph 3-colorability and parsimonious reductions in the plane (English)
0 references
10 August 2004
0 references
Computational complexity
0 references
Planar combinatorial problems
0 references
3-Colorability
0 references
Unique solution problems
0 references
Parsimonious equivalence to SAT
0 references
0 references
0.7971850633621216
0 references
0.7846083045005798
0 references
0.7832327485084534
0 references
