Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Orthogonal double covers of complete graphs by fat caterpillars

Dalibor FroncekUwe Leck — 2006

Discussiones Mathematicae Graph Theory

An orthogonal double cover (ODC) of the complete graph Kₙ by some graph G is a collection of n spanning subgraphs of Kₙ, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kₙ is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n-1 edges. We show that for any given positive integer d, almost all caterpillars of diameter d admit an ODC of the corresponding complete graph.

Page 1

Download Results (CSV)