The price of connectivity for dominating set: upper bounds and complexity (Q406321): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5419953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Connectivity for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex covers in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's Number and the Stability Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the characterization of domination perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs for which the connected domination number is at most the total domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect connected-dominant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-induced subgraph characterization of upper domination perfect graphs / rank
 
Normal rank

Latest revision as of 00:08, 9 July 2024

scientific article
Language Label Description Also known as
English
The price of connectivity for dominating set: upper bounds and complexity
scientific article

    Statements

    The price of connectivity for dominating set: upper bounds and complexity (English)
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    domination
    0 references
    connected domination
    0 references
    forbidden induced subgraphs
    0 references
    computational complexity
    0 references

    Identifiers

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