Parameterized complexity of maximum edge colorable subgraph (Q2088595)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized complexity of maximum edge colorable subgraph
scientific article

    Statements

    Parameterized complexity of maximum edge colorable subgraph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2022
    0 references
    edge coloring
    0 references
    kernelization
    0 references
    FPT algorithms
    0 references
    kernel lower bound
    0 references

    Identifiers