[1]
Caro, Y. and Yuster, R. 1997. Efficient Covering Designs of the Complete Graph. The Electronic Journal of Combinatorics. 4, 1 (Feb. 1997), R10. DOI:https://doi.org/10.37236/1295.