T. Gustavsson, “Decompositions of Large Graphs and Digraphs with High Minimum Degree,” Ph.D. Thesis, University of Stockholm, Stockholm, 1991.
has been cited by the following article:
TITLE: 4-Cycle Decompositions of Graphs
AUTHORS: Teresa Sousa
KEYWORDS: Graph Decomposition; 4-Cycle Packing; Graph Packing
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.4, November 1, 2012
ABSTRACT: In this paper we consider the problem of finding the smallest number such that any graph G of order n admits a decomposition into edge disjoint copies of C4 and single edges with at most elements. We solve this problem for n sufficiently large.