The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0213008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139013226 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:55, 20 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
