\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac2{{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Teresa Sousa}
%
%
\medskip
\noindent
%
%
{\bf Decompositions of Graphs into 5-Cycles and Other Small Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
In this paper we consider the problem of finding the smallest number
$q$ such that any graph $G$ of order $n$ admits a decomposition into
edge disjoint copies of a fixed graph $H$ and single edges with at
most $q$ elements. We solve the case when $H$ is the 5-cycle, the
5-cycle with a chord and any connected non-bipartite non-complete
graph of order 4.

\bye

.
