On unique graph 3-colorability and parsimonious reductions in the plane (Q596079): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037855784 / rank | |||
Normal rank | |||
Revision as of 21:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On unique graph 3-colorability and parsimonious reductions in the plane |
scientific article |
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
