On orthogonal double covers of graphs

DOI10.1023/A:1016546402248zbMath1001.05091OpenAlexW1529827858MaRDI QIDQ5894828

Uwe Leck, Volker Leck, Martin Grüttmüller, Sven Hartmann, Hans-Dietrich O. F. Gronau

Publication date: 17 September 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1016546402248

zbMATH Keywords

graph decompositionsorthogonal double coversself-orthogonal factorization

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (26)

Orthogonal double covers of circulant graphs by corona product of certain infinite graph classes ⋮ New type of coding problem motivated by database theory ⋮ Super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ Orthogonal double covers of complete graphs by caterpillars of diameter 5 ⋮ Super-simple twofold Steiner pentagon systems ⋮ The novel generally described graphs for cyclic orthogonal double covers of some circulants ⋮ Cyclic orthogonal double covers of 4-regular circulant graphs ⋮ Cartesian product of two symmetric starter vectors of orthogonal double covers ⋮ More orthogonal double covers of complete graphs by Hamiltonian paths ⋮ On Cartesian products of orthogonal double covers ⋮ General symmetric starter of orthogonal double covers of complete bipartite graph ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Super-simple (\(v\),\,5,\,2)-designs. ⋮ TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES ⋮ ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS ⋮ Super-simple Steiner pentagon systems ⋮ Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 ⋮ Orthogonal double covers of Cayley graphs ⋮ Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures ⋮ Unnamed Item ⋮ On defining sets of full designs ⋮ A complete classification of 5-regular circulant graphs that allow cyclic orthogonal double covers ⋮ Coding Theory Motivated by Relational Databases ⋮ Orthogonal covers by multiplication graphs ⋮ Partitions with certain intersection properties ⋮ Self-orthogonal decompositions of graphs into matchings

This page was built for publication: On orthogonal double covers of graphs