No label defined (Q3976609)

[For the entire collection see Zbl 0734.00014.] In a previous paper [\textit{P. Z. Chinn}, \textit{P. A. Thoelecke}, \textit{R. B. Richter}, Ars Comb. 26, 45-52 (1988; Zbl 0679.05063)] edge-disjoint decompositions of graphs into pairwise nonisomorphic graphs and the corresponding notion of the set of ``primal graphs'' were investigated. In the paper under review the restriction requiring the decomposing graphs to be nonisomorphic is relaxed, thus arriving at a set of graphs called ``primary graphs''. Several of the authors' theorems regarding primary graphs are analogs to those previously proved for primal graphs. All primary graphs of order \(\leq 7\) are determined. A constructive procedure is given for decomposing caterpillars into primary caterpillars and all of the primary caterpillars are determined. Several open problems are presented.