The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1267542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of some problems related to GRAPH 3-COLORABILITY |
scientific article; zbMATH DE number 1267542 |
Statements
The complexity of some problems related to GRAPH 3-COLORABILITY (English)
0 references
22 March 1999
0 references
graph 3-colorability problem
0 references
0.831006646156311
0 references
0.8262503743171692
0 references
0.8079324960708618
0 references
0.8052863478660583
0 references
