Author(s)

Teresa Sousa

Departamento de Matemática and Centro de Matemática e Aplica??es, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Lisbon, Portugal.

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 C₄ and single edges with at most elements. We solve this problem for n sufficiently large.

Graph Decomposition; 4-Cycle Packing; Graph Packing

T. Sousa, "4-Cycle Decompositions of Graphs," Open Journal of Discrete Mathematics, Vol. 2 No. 4, 2012, pp. 125-130. doi: 10.4236/ojdm.2012.24024.