𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Orthogonal Double Covers of Graphs

✍ Scribed by Darryn E. Bryant; A. Khodkar

Book ID
110261278
Publisher
Springer
Year
1998
Tongue
English
Weight
41 KB
Volume
13
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Orthogonal Double Covers of Graphs
On Orthogonal Double Covers of Graphs
✍ Hans-Dietrich O. F. Gronau; Martin GrΓΌttmΓΌller; Sven Hartmann; Uwe Leck; Volker πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 288 KB
Orthogonal double covers of general grap
Orthogonal double covers of general graphs
✍ Sven Hartmann; Ulrike Schumacher πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 344 KB

Let H be a graph on n vertices and G a collection of n subgraphs of H , one for each vertex. Then G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H . ODCs of complet

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:

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