𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Orthogonal double covers of Kn,n by small graphs

✍ Scribed by Ramadan El-Shanawany; Hans-Dietrich O.F. Gronau; Martin Grüttmüller

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
443 KB
Volume
138
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

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:

📜 SIMILAR VOLUMES

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

On orthogonal double covers of kn and a
On orthogonal double covers of kn and a conjecture of chung and west
✍ H.-D. O. F. Gronau; R. C. Mullin; P. J. Schellenberg 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 909 KB

A collection = {GI, CZ, . . . , C,} of spanning subgraphs of K, is called an orthogonal double cover if (i) every edge of K , belongs to exactly two of the Ci's and (ii) any two distinct Ci's intersect in exactly one edge. Chung and West conjectured that there exists an orthogonal double cover of K,

Hajós' conjecture and small cycle double
Hajós' conjecture and small cycle double covers of planar graphs
✍ Karen Seyffarth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 865 KB

## Seyffarth, K., Hajos' conjecture and small cycle double covers of planar graphs, Discrete Mathematics 101 (1992) 291-306. We prove that every simple even planar graph on n vertices has a partition of its edge set into at most [(n -1)/2] cycles. A previous proof of this result was given by Tao,