Geodesic
On the one edge algorithm for the orthogonal double covers
Prikladnaâ diskretnaâ matematika, no. 3 (2019), pp. 78-84

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: symmetric starter, orthogonal double covers.
Mots-clés : graph decomposition 
@article{PDM_2019_3_a8,
     author = {R. El-Shanawany and A. El-Mesady},
     title = {On the one edge algorithm for the orthogonal double covers},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {78--84},
     publisher = {mathdoc},
     number = {3},
     year = {2019},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/PDM_2019_3_a8/}
}
TY  - JOUR
AU  - R. El-Shanawany
AU  - A. El-Mesady
TI  - On the one edge algorithm for the orthogonal double covers
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2019
SP  - 78
EP  - 84
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2019_3_a8/
LA  - en
ID  - PDM_2019_3_a8
ER  - 
%0 Journal Article
%A R. El-Shanawany
%A A. El-Mesady
%T On the one edge algorithm for the orthogonal double covers
%J Prikladnaâ diskretnaâ matematika
%D 2019
%P 78-84
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2019_3_a8/
%G en
%F PDM_2019_3_a8
R. El-Shanawany; A. El-Mesady. On the one edge algorithm for the orthogonal double covers. Prikladnaâ diskretnaâ matematika, no. 3 (2019), pp. 78-84. http://geodesic.mathdoc.fr/item/PDM_2019_3_a8/