scientific article; zbMATH DE number 19180

MaRDI QIDQ3976609zbMATH OpenFDO

Authors Phyllis Chinn, Lin Yixun

Publication date 26 June 1992

zbMATH Keywords

caterpillarsdecomposing graphsprimal graphsprimary graphs

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

[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.

Cited in

(8)

• The existence of infinitely many primary trees
• Primal lobsters
• On primal graphs with maximum degree 2
• scientific article; zbMATH DE number 4204389 (Why is no real title available?)
• scientific article; zbMATH DE number 4073030 (Why is no real title available?)
• scientific article; zbMATH DE number 568791 (Why is no real title available?)
• scientific article; zbMATH DE number 734482 (Why is no real title available?)
• scientific article; zbMATH DE number 749307 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976609)