Edge Decomposition into Isomorphic Copies ofsK1, 2Is Polynomial

Journal of Combinatorial Theory. Series B

Volumn 69, Issue 2, 1997, Pages 164-182

  Lonc, Zbigniew ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040655285     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.1735     Document Type: Article

References (13)

1. Alon N. A note on the decomposition of graphs into isomorphic matchings. Acta Math. Acad. Sci. Hung. 42:1983;221-223.
2. Bermond J. C., Sotteau D. Graph decomposition andG. Proceedings of the 5th British Combinatorial Conference. 1975;Aberdeen.
3. 2. Acta Math. Acad. Sci. Hung. 40:1982;201-208.
4. Bosak J. Graph Decompositions. 1990;Kluwer Academic.
5. A. E. Brouwer, R. M. Wilson, 1980, The decomposition of graphs into ladder graphs, Stiching Mathematisch Centrum (zn 97/80), Amsterdam.
6. Chung F. R. K., Graham R. L. Recent results in graph decompositions. Combinatorics. Lecture Notes Series. Vol. 52:1981;Cambridge Univ. PressLondon Mathematical Society, Cambridge.
7. Cohen E., Tarsi M. NP-completeness of graph decomposition problem. J. Complexity. 7:1991;200-212.
8. Corneil D. G., Masuyama S., Hakimi S. L. Edge-disjoint packings of graphs. Discrete Appl. Math. 50:1994;135-148.
9. D. Dor, M. Tarsi, 1992, Graph decomposition is NPC - A complete proof of Holyer's conjecture, Proceedings of the 24th Annual ACM Symposium on Theory of Computing.
10. Favaron O., Lonc Z., Truszczyński M. Decomposition of graphs into graphs with three edges. Ars Combinatoria. 20:1985;125-146.
11. Hell P., Kirkpatrick D. G. On the complexity of general graph factor problems. SIAM J. Comput. 12:1983;601-609.
12. Holyer I. The NP-completeness of some edge partition problems. SIAM J. Comput. 10:1981;713-717.
13. 2. Ars Combinatoria. 35:1993;325-333.