On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849)

From MaRDI portal
Revision as of 10:39, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
scientific article

    Statements

    On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    \(\{k\}\)-domination
    0 references
    \(k\)-tuple domination
    0 references
    split graphs
    0 references
    planar graphs
    0 references
    chordal graphs
    0 references