Affiliation:
1. Department of Mathematics Marshall University Huntington West Virginia USA
Abstract
AbstractA 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.
Subject
Discrete Mathematics and Combinatorics