On the computational complexity of partial covers of theta graphs (Q2482109)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational complexity of partial covers of theta graphs
scientific article

    Statements

    On the computational complexity of partial covers of theta graphs (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    0 references
    computational complexity
    0 references
    graph homomorphisms
    0 references
    theta graphs
    0 references
    0 references