The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 10:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem |
scientific article |
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
