Year: 2012
Type: article
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.
Author: Teresa Sousa
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2107912185