4-Cycle Decompositions of Graphs - Open Journal of Discrete Mathematics

OJDM > Vol.2 No.4, October 2012

Open Journal of Discrete Mathematics

Volume 2, Issue 4 (October 2012)

ISSN Print: 2161-7635 ISSN Online: 2161-7643

Google-based Impact Factor: 0.64 Citations

4-Cycle Decompositions of Graphs ()

HTML

Download as PDF (Size: 218KB) PP. 125-130

DOI: 10.4236/ojdm.2012.24024 5,098 Downloads 7,825 Views Citations

Author(s)

Teresa Sousa

Affiliation(s)

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

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

KEYWORDS

Graph Decomposition; 4-Cycle Packing; Graph Packing

Share and Cite:

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

Cited by

[1]	Minimum H-Decompositions of Graphs and Its Ramsey Version: A Survey
	Dynamics, Games and Science, 2015

[2]	Задачи и инварианты, связанные с бикликами и мультикликами графа
	Труды Института математики, 2013