完全有向图的奇长圈覆盖问题

Coverings of DK v with Odd Length Circuits

给出了完全有向图ＤＫｖ的覆盖数Ｃ（ｖ，ｍ），这里ｖ＝ｍ＋５，２ｍ－３且ｍ是大于１的奇数．当ｍＴ（ｖ，ｍ）－ｖ（ｖ－１）＝１时，给出了Ｃ（ｖ。

Let DK v denote the complete directed graph with v vertices,covering number C(v,m) of DK v is a minimum number of covering DK v by m circuits.When m ≥3 is a odd integer,the covering number C(m+5,m) and C(2m-3,m) are determined.