On the NP-completeness of the perfect matching free subgraph problem (Q418003)

From MaRDI portal
Revision as of 12:45, 21 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
On the NP-completeness of the perfect matching free subgraph problem
scientific article

    Statements

    On the NP-completeness of the perfect matching free subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references