Efficient covering designs of the complete graph.
Caro, Yair ; Yuster, Raphael
The Electronic Journal of Combinatorics [electronic only], Tome 4 (1997), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1997-01-01
EUDML-ID : urn:eudml:doc:119240 
@article{01117995,
     title = {Efficient covering designs of the complete graph.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {4},
     year = {1997},
     zbl = {0885.05019},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01117995}
}

Caro, Yair; Yuster, Raphael. Efficient covering designs of the complete graph.. The Electronic Journal of Combinatorics [electronic only], Tome 4 (1997) . http://gdmltest.u-ga.fr/item/01117995/