完全图的最大(最小)几乎可分解的(4,2)-圈填充(覆盖)

王长远, 曹海涛

Maximum (Minimum) Almost Resolvable (4,2)-cycle Packing (Covering) of a Complete Graph

WANG Changyuan, CAO Haitao

应用数学学报 . 2015, (1): 183 -192 . DOI: 10.12387/C2015017