UNIFORM COVERINGS OF 2-PATHS IN THE COMPLETE BIPARTITE DIRECTED GRAPH
Let Gbe a directed graph and H be a subgraph of G. A design is a multiset of subgraphs of Geach isomorphic to Hso that every directed 2-path in Glies in exactly subgraphs in In this paper, we show that there exists a design for every where is the complete bipartite directed graph and is a directed Hamilton cycle in
covering of 2-paths, Dudeney design, Dudeney’s round table problem.