Parameterized complexity of connected even/odd subgraph problems (Q395000): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60488404, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Eulerian Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank

Latest revision as of 07:36, 7 July 2024

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