Edge decompositions and rooted packings of graphs
Authors:
- 29 June 2022
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (12)
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Edge decompositions into two kinds of graphsDiscrete Mathematics, 2009
- Polynomial cases of graph decomposition: A complete solution of Holyer’s problemDiscrete Mathematics, 2009
- Combinatorial and computational aspects of graph packing and graph decompositionComputer Science Review, 2007
- Delta-system decompositions of graphsDiscrete Mathematics, 1997
- On the complexity of some edge-partition problems for graphsDiscrete Applied Mathematics, 1996
- NP-Completeness of graph decomposition problemsJournal of Complexity, 1991
- Packings by cliques and by finite families of graphsDiscrete Mathematics, 1984
- A note on the decomposition of graphs into isomorphic matchingsActa Mathematica Hungarica, 1983
- 3K2-decomposition of a graphActa Mathematica Hungarica, 1982
- Packing subgraphs in a graphOperations Research Letters, 1982