On the one edge algorithm for the orthogonal double covers

The existing problem of the orthogonal double covers of the graphs is well-known in the theory of combinatorial designs. In this paper, a new technique called the one edge algorithm for constructing the orthogonal double covers of the complete bipartite graphs by copies of a graph is introduced. The advantage of this algorithm is that it is accessible to discrete mathematicians not intimately familiar with the theory of the orthogonal double covers.