P. Erd?s, A. W. Goodman and L. Pósa, “The Representation of a Graph by Set Intersections,” Canadian Journal of Mathematics, Vol. 18, No. 1, 1966, pp. 106-112. doi:10.4153/CJM-1966-014-3

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.