The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem (Q3323288)

From MaRDI portal
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references