N. Alon, Y. Caro and R. Yuster, “Packing and Covering Dense Graphs,” Journal of Combinatorial Designs, Vol. 6, No. 6, 1998, pp. 451-472. doi:10.1002/(SICI)1520-6610(1998)6:6<451::AID-JCD6>3.0.CO;2-E

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.