On Self-Complementary Cyclic Packing of Forests
Abstract
A graph is 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.
Published
2007-09-07
How to Cite
Wojda, A., Woźniak, M., & Zioło, I. A. (2007). On Self-Complementary Cyclic Packing of Forests. The Electronic Journal of Combinatorics, 14(1), R62. https://doi.org/10.37236/980
Issue
Article Number
R62