Primitive C4 ${C}_{4}$‐decompositions of Kn−I ${K}_{n}-I$
- 5 May 2023
- journal article
- research article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 31 (8) , 368-372
Abstract
A decomposition of a graph is primitive if no proper, nontrivial subset of is a decomposition of an induced subgraph of . An unresolved question posed by Asplund et al. in a recent publication involves the existence of primitive decompositions of cocktail party graphs into cycles of length 4, which is resolved by this paper.Keywords
This publication has 3 references indexed in Scilit:
- Primitive cycle decompositions of Kn and Kn−IJournal of Combinatorial Designs, 2022
- Minimum coverings ofK? with copies ofK4 - e which contain no proper subsystemsJournal of Combinatorial Designs, 2000
- Sur la structure de certains syst mes triples de SteinerMathematische Zeitschrift, 1969