Article contents
Packing and Covering of the Complete Graph with 4-Cycles*
Published online by Cambridge University Press: 20 November 2018
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1975
Footnotes
*
This research was supported in part by N.R.C. grant #A5198.
References
1.
Beineke, L. W., A survey of packings and coverings of graphs. The Many Facets of Graph Theory. Ed. Chartrand, G. and Kapoor, S. F.. Berlin, Heidelberg, New York
1969, p. 45.Google Scholar
3.
Chartrand, G., Geller, D. and Hedetniemi, S., Graphs with forbidden subgraphs. J. Combinatorial Theory B.
10 (1971) 12–41.Google Scholar
4.
Fort, M. K. Jr, and Hedlund, G. A., Minimal coverings of pairs by triples. Pacific Journal Math.
8 (1958) 709–719.Google Scholar
5.
Schönheim, J., On maximal systems of k-tuples. Studia Sci. Math. Hungarica (1966) 363–368.Google Scholar
6.
Hanani, H., The existence and construction of balanced incomplete block designs. Annals of Math. Statistics
6 (1961) 362–386.Google Scholar
7.
Kotzig, A., On decompositions of the complete graph into 4k-gons. (In Russian). Mat.-fyz. casopis SAV
15 (1965), 229–232.Google Scholar
8.
Rosa, A., O cyklickych rozkladoch komletneho grafu na neparnouholniky. Cas. pest. mat.
91 (1966) 53–63.Google Scholar
- 19
- Cited by