Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau. Edge-disjoint spanners of complete graphs and complete digraphs. Discrete Mathematics, 203(1-3):133-159, 1999. [doi]
@article{LaforestLPSS99,
title = {Edge-disjoint spanners of complete graphs and complete digraphs},
author = {Christian Laforest and Arthur L. Liestman and David Peleg and Thomas C. Shermer and Dominique Sotteau},
year = {1999},
doi = {10.1016/S0012-365X(99)00012-6},
url = {http://dx.doi.org/10.1016/S0012-365X(99)00012-6},
tags = {completeness, graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/LaforestLPSS99},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {203},
number = {1-3},
pages = {133-159},
}