Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination in two subclasses of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Polynomial Cases of the Weighted Efficient Domination Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Polynomial Case for Efficient Domination in P 6-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and Efficient Domination on <i>P</i><sub>6</sub>-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Efficiently Dominatable Graphs / rank
 
Normal rank

Latest revision as of 18:26, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time
scientific article

    Statements

    Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2016
    0 references
    efficient domination
    0 references
    chordal graphs
    0 references
    hole-free graphs
    0 references
    (house, hole, domino)-free graphs
    0 references
    \(P_6\)-free graphs
    0 references
    polynomial-time algorithm
    0 references

    Identifiers