NP-Completeness of graph decomposition problems
- 1 June 1991
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 7 (2) , 200-212
- https://doi.org/10.1016/0885-064x(91)90006-j
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A note on the decomposition of graphs into isomorphic matchingsActa Mathematica Hungarica, 1983
- 3K2-decomposition of a graphActa Mathematica Hungarica, 1982
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- Combinatorische Aufgaben.Journal für die reine und angewandte Mathematik (Crelles Journal), 1853