Polynomial cases of graph decomposition: A complete solution of Holyer’s problem
Authors:
- 6 April 2009
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (6) , 1294-1326
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's ConjectureSIAM Journal on Computing, 1997
- Edge Decomposition into Isomorphic Copies ofsK1, 2Is PolynomialJournal of Combinatorial Theory, Series B, 1997
- Edge-disjoint packings of graphsDiscrete Applied Mathematics, 1994
- NP-Completeness of graph decomposition problemsJournal of Complexity, 1991
- General factors of graphsJournal of Combinatorial Theory, Series B, 1988
- A note on the decomposition of graphs into isomorphic matchingsActa Mathematica Hungarica, 1983
- On the Complexity of General Graph Factor ProblemsSIAM Journal on Computing, 1983
- 3K2-decomposition of a graphActa Mathematica Hungarica, 1982
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981