Computational Complexity of Covering Three-Vertex Multigraphs (Q2922636)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computational Complexity of Covering Three-Vertex Multigraphs
scientific article

    Statements

    Computational Complexity of Covering Three-Vertex Multigraphs (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    graph homomorphism
    0 references
    covering projection
    0 references
    0 references