D-graphs. IV: Constructions of D-graphs for linear cacti. (English) Zbl 0962.05048
Summary: A construction is given for the D-graphs of graphs formed by node attachments of polygons, so as to form chain-like structures. The problem is solved entirely for figure-8 graphs and for all such linear structures.
MSC:
| 05C70 | Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) |
