Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037)

From MaRDI portal
Revision as of 15:52, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Independent domination in finitely defined classes of graphs: polynomial algorithms
scientific article

    Statements

    Independent domination in finitely defined classes of graphs: polynomial algorithms (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2015
    0 references
    independent domination
    0 references
    finitely defined class of graphs
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references

    Identifiers