Packing graphs: The packing problem solved

Electronic Journal of Combinatorics

Volumn 4, Issue 1 R, 1997, Pages 1-7

  Caro, Yair ^a   Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038923608     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. S. Bitan and T. Etzion, The last packing number of quadruples and cyclic SQS, Design, Codes and Cryptography 3 (1993), 283-313.
2. n, J. Combin. Theory, Ser. A 26 (1979), 278-297.
3. A.E. Brouwer, Block Designs, in: Chapter 14 in "Handbook of Combinatorics", R. Graham, M. Grötschel and L. Lovász Eds. Elsevier, 1995.
4. A. Brouwer, J. Shearer, N. Sloane and W. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory 36 (1990), 1334-1380.
5. B. Bollobás, Extremal Graph Theory, Academic Press, 1978.
6. Y. Caro and R. Yuster, Covering graphs: The covering problem solved, submitted.
7. C.J. Colbourn and J.H. Dinitz, CRC Handbook of Combinatorial Design, CRC press 1996.
8. D. Dor and M. Tarsi, Graph decomposition is NPC - A complete proof of Holyer's conjecture, Proc. 20th ACM STOC, ACM Press (1992), 252-263.
9. P. Erdos and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Math. Lapok 11 (1960), 264-274.
10. T. Gustavsson, Decompositions of large graphs and digraphs with high minimum degree, Doctoral Dissertation, Dept. of Mathematics, Univ. of Stockholm, 1991.
11. H. Hanani, Balanced incomplete block designs and related designs, Discrete Math. 11 (1975), 255-369.
12. S.M. Johnson, A new upper bound for error-correcting codes, IEEE Trans. Inform. Theory 8 (1962), 203-207.
13. W.H. Mills and R.C. Mullin, Coverings and packings, in: Contemporary Design Theory: A collection of Surveys, 371-399, edited by J. H. Dinitz and D. R. Stinson. Wiley, 1992.
14. R.C. Mullin and J. Yin, On packing of pairs by quintuples v - 3,9,17(mod20), Ars Combinatoria 35 (1993), 161-171.
15. Y. Roditty, Packing and covering of the complete graph with a graph G of four vertices or less, J. Combin. Theory, Ser. A 34 (1983), 231-243.
16. Y. Roditty, Packing and covering of the complete graph IV, the trees of order 7, Ars Combinatoria 35 (1993), 33-64.
17. A. Rosa and S. Znam, Packing pentagons into complete graphs: how clumsy can you get, Discrete Math. 128 (1994), 305-316
18. J. Schonheim, On maximal systems of k-tuples, Studia Sci. Math. Hungar. (1966), 363-368.
19. J. Schonheim and A. Bialostocki, Packing and covering of the complete graph with 4-cycles, Canadian Math. Bull. 18 (1975), 703-708.
20. nd Chapel Hill Conf. on Combinatorial Mathematics and its applications. Univ. North Carolina, Chapel Hill (1970) 428-450.
21. R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus Numerantium XV (1975), 647-659.