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

From MaRDI portal
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
    0 references
    0 references
    0 references
    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
    0 references