J.-C. Bermond,
J. Bond,
M. Paoli,
and C. Peyrat.
Graphs and interconnection networks: diameter and vulnerability.
In Surveys in combinatorics (Southampton, 1983),
volume 82 of London Math. Soc. Lecture Note Ser.,
pages 1--30.
Cambridge Univ. Press,
Cambridge,
1983.
@incollection{MR721179,
AUTHOR = {Bermond, J.-C. and Bond, J. and Paoli, M. and Peyrat, C.},
TITLE = {Graphs and interconnection networks: diameter and vulnerability},
BOOKTITLE = {Surveys in combinatorics (Southampton, 1983)},
SERIES = {London Math. Soc. Lecture Note Ser.},
VOLUME = {82},
PAGES = {1--30},
PUBLISHER = {Cambridge Univ. Press},
ADDRESS = {Cambridge},
YEAR = {1983},
}
J.-C. Bermond,
Bill Jackson,
and François Jaeger.
Shortest coverings of graphs with cycles.
J. Combin. Theory Ser. B,
35(3):297--308,
1983.
@article{MR735197,
AUTHOR = {Bermond, J.-C. and Jackson, Bill and Jaeger, Fran{\c{c}}ois},
TITLE = {Shortest coverings of graphs with cycles},
JOURNAL = {J. Combin. Theory Ser. B},
VOLUME = {35},
YEAR = {1983},
NUMBER = {3},
PAGES = {297--308},
ISSN = {0095-8956},
}