The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700)

From MaRDI portal
Revision as of 07:57, 6 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
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
scientific article

    Statements

    The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (English)
    0 references
    0 references
    0 references
    21 March 2013
    0 references
    0 references
    connected domination
    0 references
    total domination
    0 references
    dominating subgraphs
    0 references
    computational complexity
    0 references
    combinatorial problems
    0 references
    0 references