Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436)

From MaRDI portal
Revision as of 15:48, 1 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
Polynomial cases of graph decomposition: A complete solution of Holyer's problem
scientific article

    Statements

    Polynomial cases of graph decomposition: A complete solution of Holyer's problem (English)
    0 references
    0 references
    0 references
    17 June 2009
    0 references
    edge decompositions of graphs
    0 references
    computational complexity
    0 references
    holyer problem
    0 references

    Identifiers