Decompositions of complete graphs into theta graphs with fewer than ten edges
Abstract
A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K v into theta graphs with fewer than ten edges are given.











