The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288)
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 3854440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem |
scientific article; zbMATH DE number 3854440 |
Statements
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (English)
0 references
1984
0 references
lower bound
0 references
decision tree
0 references
Hamiltonian path
0 references
vertex-coloring
0 references
acyclic orientation
0 references
element uniqueness
0 references
0 references
0.88800025
0 references
0 references
0.88529986
0 references
0 references
0 references
0.8803598
0 references
