On self-complementary cyclic packing of forests
Summary: 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.
scientific article; zbMATH DE number 5540840