## Abstract An Orthogonal Double Cover (ODC) of the complete graph __K__~__n__~ by an almost‐hamiltonian cycle is a decomposition of 2__K__~__n__~ into cycles of length __n__−1 such that the intersection of any two of them is exactly one edge. We introduce a new class of such decompositions. If __n
On orthogonal double covers by trees
✍ Scribed by Uwe Leck; Volker Leck
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 152 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
A collection P of n spanning subgraphs of the complete graph Kn is said to be an orthogonal double cover (ODC) if every edge of Kn 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 of G on few vertices.
📜 SIMILAR VOLUMES
## Abstract Let __C~ν~__(__T__) denote the “cover time” of the tree __T__ from the vertex __v__, that is, the expected number of steps before a random walk starting at __v__ hits every vertex of __T.__ Asymptotic lower bounds for __C~ν~__(__T__) (for __T__ a tree on __n__ vertices) have been obtain
## Abstract A double Dudeney set in __K~n~__ is a multiset of Hamilton cycles in __K~n~__ having the property that each 2‐path in __K~n~__ lies in exactly two of the cycles. A double Dudeney set in __K~n~__ has been constructed when __n__ ≥ 4 is even. In this paper, we construct a double Dudeney se
## Abstract In this note we look at the moduli space \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathcal R}\_{3,2}$\end{document} of double covers of genus three curves, branched along 4 distinct points. This space was studied by Bardelli, Ciliberto and Verra in 1