Parameterized complexity of connected even/odd subgraph problems (Q395000)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized complexity of connected even/odd subgraph problems
scientific article

    Statements

    Parameterized complexity of connected even/odd subgraph problems (English)
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    Euler graph
    0 references
    even graph
    0 references
    odd graph
    0 references
    treewidth
    0 references
    0 references
    0 references