𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orthogonal directed covers by flowers

✍ Scribed by Sven Hartmann

Book ID
104444308
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
162 KB
Volume
10
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On orthogonal double covers by trees
On orthogonal double covers by trees
✍ Uwe Leck; Volker Leck πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

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 impro

Orthogonal double covers by super-extend
Orthogonal double covers by super-extendable cycles
✍ Christian Bey; Sven Hartmann; Uwe Leck; Volker Leck πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## 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

Orthogonal double covers of Kn,n by smal
Orthogonal double covers of Kn,n by small graphs
✍ Ramadan El-Shanawany; Hans-Dietrich O.F. Gronau; Martin GrΓΌttmΓΌller πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 443 KB

An orthogonal double cover (ODC) of Kn is a collection of graphs such that each edge of Kn occurs in exactly two of the graphs and two graphs have precisely one edge in common. ODCs of Kn and their generalizations have been extensively studied by several authors (e.g. in: