Edge decompositions into two kinds of graphs (Q1045169): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.10.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029914950 / rank
 
Normal rank
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: Packing subgraphs in 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: Q4344205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings by cliques and by finite families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings by Complete Bipartite Graphs / 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: Efficient subgraphs packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delta-system decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some edge-partition problems for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4201584 / rank
 
Normal rank

Latest revision as of 07:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Edge decompositions into two kinds of graphs
scientific article

    Statements

    Edge decompositions into two kinds of graphs (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    edge decompositions of graphs
    0 references
    computational complexity
    0 references
    0 references