Obtaining split graphs by edge contraction (Q897961)

From MaRDI portal
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
    0 references
    parameterized complexity
    0 references
    edge contraction
    0 references
    split graphs
    0 references
    FPT algorithm
    0 references
    incompressibility
    0 references
    0 references