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

From MaRDI portal
Revision as of 21:33, 27 June 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
On the computational complexity of partial covers of theta graphs
scientific article

    Statements

    title
    On the computational complexity of partial covers of theta graphs (English)
    0 references
    author
    Jan Kratochvíl
    0 references
    Attila Pór
    0 references
    Jiří Fiala
    0 references
    publication date
    16 April 2008
    0 references
    zbMATH DE Number
    5264543
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    graph homomorphisms
    0 references
    theta graphs
    0 references
    OpenAlex ID
    W2025309825
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2482109&oldid=35049914"
    Powered by MediaWiki