Computational complexity of covering three-vertex multigraphs (Q897866)

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
    8 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    graph homomorphism
    0 references
    covering projection
    0 references
    0 references