On some multigraph decomposition problems and their computational complexity (Q1827716): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on the decomposition of graphs into isomorphic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3K2-decomposition of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of graph decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint packings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201584 / rank
 
Normal rank

Latest revision as of 19:25, 6 June 2024

scientific article
Language Label Description Also known as
English
On some multigraph decomposition problems and their computational complexity
scientific article

    Statements

    On some multigraph decomposition problems and their computational complexity (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Decomposition
    0 references
    Multigraph
    0 references
    NP-completeness
    0 references
    0 references