On the algorithmic complexity of \(k\)-tuple total domination (Q400524): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Total domination in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple total domination in cross products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Transversals in Hypergraphs and Double Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of the \(k\)-domination problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algorithmic Complexity of Total Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspect of \(k\)-tuple domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of chordal graphs as subtrees of a tree / rank
 
Normal rank

Latest revision as of 23:00, 8 July 2024

scientific article
Language Label Description Also known as
English
On the algorithmic complexity of \(k\)-tuple total domination
scientific article

    Statements

    On the algorithmic complexity of \(k\)-tuple total domination (English)
    0 references
    0 references
    0 references
    22 August 2014
    0 references
    \(k\)-tuple total domination
    0 references
    total domination
    0 references
    block graph
    0 references
    cactus
    0 references
    algorithm
    0 references
    NP-complete
    0 references
    undirected path graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references