Design theory
On minimum matrix representation of closure operations
Discrete Applied Mathematics
Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions
Discrete Mathematics
Self-orthogonal Hamilton path decompositions
Discrete Mathematics - Special volume: Designs and Graphs
On a problem of Hering concerning orthogonal covers of Kn8
Journal of Combinatorial Theory Series A
On Orthogonal Double Covers of Graphs
Designs, Codes and Cryptography
Extremal Combinatorial Problems in Relational Data Base
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Orthogonal double covers of Kn,n by small graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Orthogonal double covers of general graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
SGDs with doubly transitive automorphism group
Journal of Graph Theory
On Orthogonal Double Covers of Graphs
Designs, Codes and Cryptography
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
Orthogonal double covers of Kn,n by small graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Super-simple (υ, 5, 2)-designs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
New type of coding problem motivated by database theory
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Super-simple Steiner pentagon systems
Discrete Applied Mathematics
Orthogonal covers by multiplication graphs
Discrete Applied Mathematics
Orthogonal double covers of Cayley graphs
Discrete Applied Mathematics
New type of coding problem motivated by database theory
Discrete Applied Mathematics
Orthogonal double covers of Kn,n by small graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Coding theory motivated by relational databases
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
General Theory of Information Transfer and Combinatorics
| Hi-index | 0.00 |
An orthogonal double cover (ODC) is a collection of n spanning subgraphs(pages) of the complete graph Kn such that they cover every edge of the completegraph twice and the intersection of any two of them contains exactly one edge. If all the pages are isomorphic tosome graph G, we speak of an ODC by G. ODCs have been studied for almost 25 years, and existenceresults have been derived for many graph classes. We present an overview of the current state of research alongwith some new results and generalizations. As will be obvious, progress made in the last 10 years is in many waysrelated to the work of Ron Mullin. So it is natural and with pleasure that we dedicate this article to Ron, on theoccasion of his 65th birthday.