Darryn Bryant. Packing paths in complete graphs. Journal of Combinatorial Theory, Series A, 100(2):206-215, 2010. [doi]
@article{Bryant10-0,
title = {Packing paths in complete graphs},
author = {Darryn Bryant},
year = {2010},
doi = {10.1016/j.jctb.2009.08.004},
url = {http://dx.doi.org/10.1016/j.jctb.2009.08.004},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Bryant10-0},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {100},
number = {2},
pages = {206-215},
}