An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we consider the case where the graph to be covered twice is the complete bipartite graph
B. Ganter, H.-D. O. F. Gronau, and R. C. Mullin, “On orthogonal double covers of ,” Ars Combinatoria, vol. 37, pp. 209–221, 1994.
View at: Google Scholar | Zentralblatt MATH | MathSciNetB. Ganter and H.-D. O. F. Gronau, “Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions,” Discrete Mathematics, vol. 88, no. 2-3, pp. 149–155, 1991.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetF. E. Bennett and L. S. Wu, “On minimum matrix representation of closure operations,” Discrete Applied Mathematics, vol. 26, no. 1, pp. 25–40, 1990.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetH.-D. O. F. Gronau, M. Grüttmüller, S. Hartmann, U. Leck, and V. Leck, “On orthogonal double covers of graphs,” Designs, Codes and Cryptography, vol. 27, no. 1-2, pp. 49–91, 2002.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetH.-D. O. F. Gronau, R. C. Mullin, and A. Rosa, “Orthogonal double covers of complete graphs by trees,” Graphs and Combinatorics, vol. 13, no. 3, pp. 251–262, 1997.
View at: Google Scholar | Zentralblatt MATH | MathSciNetR. A. El-Shanawany, H.-D. O. F. Gronau, and M. Grüttmüller, “Orthogonal double covers of by small graphs,” Discrete Applied Mathematics, vol. 138, no. 1-2, pp. 47–63, 2004.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNetR. A. El-Shanawany, Orthogonal double covers of complete bipartite graphs, Ph.D. thesis, Universität Rostock, Rostock, Germany, 2002.
M. Sh. Higazy, A study on the orthogonal double covers of complete bipartite graphs by certain graphs, M. Sc. thesis.
V. Leck, Orthogonal double covers of , Ph.D. thesis, Universtät Rostock, Rostock, Germany, 2000.