On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds and Algorithms for Dominating Sets in Web Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring vertices of triangle-free graphs without forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting small induced subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and total domination on asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dominating-set-based routing scheme in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405639 / rank
 
Normal rank

Latest revision as of 20:54, 10 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
scientific article

    Statements

    On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (English)
    0 references
    0 references
    0 references
    30 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dominating set
    0 references
    complexity
    0 references
    algorithms
    0 references
    forbidden induced subgraphs
    0 references
    0 references