Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5

摘要

An orthogonal double cover (ODC) of the complete graph K n by a graph G is a collection = {G i |i = 1,2, . . . ,n} of spanning subgraphs of K n , all isomorphic to G, with the property that every edge of K n belongs to exactly two members of and any two distinct members of share exactly one edge.