Efficient covering designs of the complete graph.
The Electronic Journal of Combinatorics [electronic only] (1997)
- Volume: 4, Issue: 1, page Research paper R10, 8 p.-Research paper R10, 8 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCaro, Yair, and Yuster, Raphael. "Efficient covering designs of the complete graph.." The Electronic Journal of Combinatorics [electronic only] 4.1 (1997): Research paper R10, 8 p.-Research paper R10, 8 p.. <http://eudml.org/doc/119240>.
@article{Caro1997,
author = {Caro, Yair, Yuster, Raphael},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {covering},
language = {eng},
number = {1},
pages = {Research paper R10, 8 p.-Research paper R10, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Efficient covering designs of the complete graph.},
url = {http://eudml.org/doc/119240},
volume = {4},
year = {1997},
}
TY - JOUR
AU - Caro, Yair
AU - Yuster, Raphael
TI - Efficient covering designs of the complete graph.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1997
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 4
IS - 1
SP - Research paper R10, 8 p.
EP - Research paper R10, 8 p.
LA - eng
KW - covering
UR - http://eudml.org/doc/119240
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.