Computational complexity of covering three-vertex multigraphs (Q897866)

From MaRDI portal
Revision as of 04:45, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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