\(2K_{2}\) vertex-set partition into nonempty parts (Q966027)

From MaRDI portal
Revision as of 00:16, 8 July 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
\(2K_{2}\) vertex-set partition into nonempty parts
scientific article

    Statements

    \(2K_{2}\) vertex-set partition into nonempty parts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    structural graph theory
    0 references
    fixed-parameter algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references