Nearly complete graphs decomposable into large induced matchings and their applications (Q363228)

From MaRDI portal
Revision as of 17:20, 20 June 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
Nearly complete graphs decomposable into large induced matchings and their applications
scientific article

    Statements

    Nearly complete graphs decomposable into large induced matchings and their applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2013
    0 references