Minimum Coverings of Complete Directed Graphs with Odd Size Circuits
Zhihe Liang · Journal of Mathematical Research and Exposition · 2002
Let DKv denote the symmetric complete directed graph with v vertices, the covering number C(v,m) is a minimum number of covering DKv by m-circuits. In this paper, C(v,m) is determined for any fixed odd positive integer m and positive integer v, m ≤ v ≤ m + 6.