论文信息 - Packing and Covering of the Complete Graph with 4-Cycles*

Packing and Covering of the Complete Graph with 4-Cycles*

Abstract The maximal number of pairwise edge disjoint 4-cycles in the complete graph Kn and the minimal number of 4-cycles whose union is Kn are determined.

Arie Bialostocki | J. Schönheim | A. Bialostocki | J. Schönheim

[1] L. Beineke. A survey of packings and coverings of graphs , 1969 .

[2] G. Chartrand,et al. Graphs with Forbidden Subgraphs , 1971 .

[3] H. Hanani. The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[4] Marion Fort,et al. Minimal coverings of pairs by triples , 1958 .