Abstract
A transformation which allows us to obtain an orthogonal double cover of a graph G from any permutation of the edge set of G is described. This transformation is used together with existence results for self-orthogonal latin squares, to give a simple proof of a conjecture of Chung and West.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Brayton, D. Coppersmith and A.J. Hoffman, Self-orthogonal latin squares of all orders n≠ 2, 3, 6, Bull. Amer. Math. Soc., Vol. 80 (1974) pp. 116-118.
M.S. Chung and D.B. West, The p-intersection number of a complete bipartite graph and orthogonal double coverings of a clique, Combinatorica, Vol. 14 (1994) pp. 453-461.
B. Ganter and H.-D.O.F. Gronau, On two conjectures of Demetrovics, Füredi and Katona on partitions, Discrete Math., Vol. 88 (1991) pp. 149-155.
B. Ganter, H.-D.O.F. Gronau, and R.C. Mullin, On orthogonal double covers of K n, Ars Combin., Vol. 37 (1994) pp. 209-221.
H.-D.O.F. Gronau, R.C. Mullin, and P.J. Schellenberg, On orthogonal double covers of K n and a conjecture of Chung and West, J. Combin. Designs, Vol. 3 (1995) pp. 213-231.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bryant, D.E., Khodkar, A. On Orthogonal Double Covers of Graphs. Designs, Codes and Cryptography 13, 103–105 (1998). https://doi.org/10.1023/A:1008283627078
Issue Date:
DOI: https://doi.org/10.1023/A:1008283627078