Obtaining split graphs by edge contraction (Q897961)

From MaRDI portal
Revision as of 21:27, 6 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
Obtaining split graphs by edge contraction
scientific article

    Statements

    Obtaining split graphs by edge contraction (English)
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    parameterized complexity
    0 references
    edge contraction
    0 references
    split graphs
    0 references
    FPT algorithm
    0 references
    incompressibility
    0 references

    Identifiers