Uwe Leck, Volker Leck
On orthogonal double covers by trees
Preprint series: Preprints aus dem Fachbereich Mathematik, Universität Rostock

MSC:

05B99 None of the above but in this section

Abstract: A collection $P$ of $n$ spanning subgraphs of the complete graph
$K_n$ is said to be an Orthogonal Double Cover (ODC) if every
edge of $K_n$ belongs to exactly two members of $P$ and every
two elements of $P$ share exactly one edge. We consider the case
when all graphs in $P$ are isomorphic to some tree $G$ and
improve former results on the existence of ODCs, especially for
trees $G$ of short diameter and for trees $G$ on few vertices.

Keywords: orthogonal double covers