Abstract
In this paper we consider the problem of finding the smallest number t such that any graph G of order n admits a de-composition into edge disjoint copies of C4 and single edges with at most t elements. We solve this problem for n sufficiently large.
| Original language | Unknown |
|---|---|
| Pages (from-to) | 125-130 |
| Journal | Open Journal of Discrete Mathematics |
| Volume | 2 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Jan 2012 |