scientific article; zbMATH DE number 908567

MaRDI QIDQ4887951zbMATH OpenFDO

Authors Uwe Leck, Volker Leck

Publication date 26 September 1996

zbMATH Keywords

algorithmorthogonal double cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Orthogonal double covers of general graphs.
• On orthogonal double covers of graphs
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• Orthogonal double covers of 4-regular circulant graphs
• Cyclic orthogonal double covers of complete graphs by some complete multipartite graphs

Cited in

(7)

• Design type problems motivated by database theory
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• New type of coding problem motivated by database theory
• Orthogonal double covers of 4-regular circulant graphs
• Partitions with certain intersection properties
• Cyclic orthogonal double covers of 4-regular circulant graphs
• On the one edge algorithm for the orthogonal double covers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887951)