On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs (Q5283382)
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 the exact complexity of Hamiltonian Cycle and q-Colouring in disk graphs |
scientific article; zbMATH DE number 6751076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs |
scientific article; zbMATH DE number 6751076 |
Statements
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (English)
0 references
21 July 2017
0 references
0 references
0 references
0.7816268801689148
0 references
0.7506077289581299
0 references
0.7467285394668579
0 references
0.7420368790626526
0 references
0.740295946598053
0 references
