Packing and Decomposition of Graphs with Trees

Journal of Combinatorial Theory. Series B

Volumn 78, Issue 1, 2000, Pages 123-140

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. Alon N., Spencer J. H. The Probabilistic Method. 1991;John Wiley and Sons Inc. New York.
2. Bollobás B. Extremal Graph Theory. 1978;Academic Press.
3. Bollobás B. Some remarks on packing trees. Discrete Math. 46:1983;203-204.
4. Caro Y., Yuster R. Packing graphs: The packing problem solved. Elect. J. Combin. 4:1997.
5. Caro Y., Yuster R. Covering graphs: The covering problem solved. J. Combin. Theory Ser. A. 83:1998;273-282.
6. Chang Y. A bound for Wilson's Theorem, III. J. Combinatorial Designs. 4:1996;83-93.
7. Dor D., Tarsi M. Graph decomposition is NPC - A complete proof of Holyer's conjecture. Proc. 20th ACM STOC. 1992;ACM Press. p. 252-263.
8. Gustavsson T. Decompositions of Large Graphs and Digraphs with High Minimum Degree. 1991;Univ. of StockholmDept. of Mathematics.
9. Nash-Williams C. St. J. A. An unsolved problem concerning decomposition of graphs into triangles. Erdos P., Rényi P., Sós V. T. Combinatorial Theory and its Applications III. 1970;1179-1183 North Holland.
10. Wilson R. M. Decomposition of Complete Graphs Into Subgraphs Isomorphic to a Given Graph. Congressus Numerantium XV. 1975;. p. 647-659.
11. Yuster R. Tree packing of graphs. Random Structures and Algorithms. 12:1998;237-251.