Packings and coverings of the complete d
β
F.E. Bennett; J. Yin
π
Article
π
1996
π
Elsevier Science
π
English
β 337 KB
Let 2DK~, denote the complete directed multigraph with v vertices, where any two distinct vertices x and y are joined by 2 arcs (x,y) and 2 arcs (y,x). By a k-circuit we mean a directed cycle of length k. In this paper, we consider the problem of finding maximal packings and minimal coverings of 2DK