A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593)

From MaRDI portal
Revision as of 16:35, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A note on efficient domination in a superclass of \(P_5\)-free graphs
scientific article

    Statements

    A note on efficient domination in a superclass of \(P_5\)-free graphs (English)
    0 references
    0 references
    0 references
    17 April 2014
    0 references
    combinatorial problems
    0 references
    domination in graphs
    0 references
    efficient domination
    0 references
    perfect code
    0 references

    Identifiers