Edge decompositions into two kinds of graphs
type: Item
instance of: scholarly article
title: Edge decompositions into two kinds of graphs
zbMATH Open document ID: 1210.05111
author: Zbigniew Lonc
author: Monika Pszczoła
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5648193
zbMATH Keywords: edge decompositions of graphs
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.disc.2008.10.024
OpenAlex ID: W2029914950
cites work: A note on the decomposition of graphs into isomorphic matchings
cites work: 3K2-decomposition of a graph
cites work: Packing subgraphs in a graph
cites work: NP-completeness of graph decomposition problems
cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
cites work: Q4344205
cites work: Q3741644
cites work: On the Complexity of General Graph Factor Problems
cites work: Packings by cliques and by finite families of graphs
cites work: Packings by Complete Bipartite Graphs
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Efficient subgraphs packing
cites work: Delta-system decompositions of graphs
cites work: Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
cites work: On the complexity of some edge-partition problems for graphs
cites work: Q4201584
DOI: 10.1016/J.DISC.2008.10.024
description: scientific article; zbMATH DE number 5648193