Covering Graphs: The Covering Problem Solved

Journal of Combinatorial Theory. Series A

Volumn 83, Issue 2, 1998, Pages 273-282

  Caro, Yair ^a   Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038901732     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1998.2867     Document Type: Article

References (22)

1. A. Assaf.
2. Bailey R. A. Designs: Mappings between structured sets (Section 5). Siemons J. Survey in Combinatorics. LMS series 141. 1989;22-51.
3. Brouwer A. E. Block designs. Graham R., Grötschel M., Lovász L. Handbook of Combinatorics. 1995;Elsevier, Amsterdam/New York.
4. Bollobás B. Extremal Graph Theory. 1978;Academic Press, San Diego.
5. Y. Caro, J. Schonheim, Y. Roditty, Covering designs with minimum overlap.
6. Caro Y., Yuster R. Packing graphs: The packing problem solved. Electron J. Combin. 4:1997.
7. Colbourn C. J., Dinitz J. H. CRC Handbook of Combinatorial Design. 1996;CRC Press, Boca Raton.
8. Dor D., Tarsi M. Graph decomposition is NPC - A complete proof of Holyer's conjecture. Proc. 20th ACM STOC. 1992;252-263.
9. Erdös P., Gallai T. Graphs with prescribed degrees of vertices. Math. Lapok. 11:1960;264-274.
10. Füredi Z. Matchings and covers in hypergraphs. Graphs Combin. 4:1988;115-206.
11. Fort M. U., Hedlund G. A. Minimal coverings of pairs by triangles. Pacific J. Math. 8:1958;709-719.
12. Gronau H. D. O. F., Nesëtril J. On 2-(vλ Ars Combin. 39:1995;161-165.
13. Gustavsson T. Decompositions of Large Graphs and Digraphs with High Minimum Degree. 1991;Univ. of StockholmDept. of Mathematics.
14. Hanani H. Balanced incomplete block designs and related designs. Discrete Math. 11:1975;255-369.
15. Mills W. H. On the covering of pairs by quadruples-I. J. Combin. Theory. 13:1972;55-78.
16. Mills W. H. On the covering of pairs by quadruples-II. J. Combin. Theory. 15:1973;138-166.
17. Mills W. H., Mullin R. C. Coverings and packings. Dinitz J. H., Stinson D. R. Contemporary Design Theory: A Collection of Surveys. 1992;371-399 Wiley, New York
18. Roditty Y. Packing and covering of the complete graph with a graphG. J. Combin. Theory Ser. A. 34:1983;231-243.
19. Schonheim J. On coverings. Pacific J. Math. 14:1964;1405-1411.
20. Schonheim J., Bialostocki A. Packing and covering of the complete graph with 4-cycles. Canadian Math. Bull. 18:1975;703-708.
21. Stanton R. G., Kalbfleisch J. G., Mullin R. C. Covering and packing designs. Proc. 2nd Chapel Hill Conf. on Combinatorial Mathematics and Its Applications. 1970;Univ. North Carolina, Chapel Hill. p. 428-450.
22. Wilson R. M. Decomposition of complete graphs into subgraphs isomorphic to a given graph. Congr. Numer. XV:1975;647-659.