The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating and large induced trees in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the minimum dominating clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold dominating cliques in random graphs and interval routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete description of forbidden subgraphs in the structural domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary domination and independence parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on connected dominating sets of distance-hereditary graphs / rank
 
Normal rank

Latest revision as of 07:57, 6 July 2024

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