\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf A.Pawe{\l} Wojda, Mariusz Wo\'zniak and Irmina A. Zio{\l}o}
%
%
\medskip
\noindent
%
%
{\bf On Self-Complementary Cyclic Packing of Forests}
%
%
\vskip 5mm
\noindent
%
%
%
%
A graph is {\it self-complementary} if it is isomorphic to its
complement. In this paper we prove that every forest of order $4p$ and
size less than $3p$ is a subgraph of a self-complementary graph of
order $4p$ with a cyclic self-complementary permutation. We also
discuss some generalization of the main result.
\bye