Mao-cheng Cai. The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. Discrete Mathematics, 85(1):43-52, 1990. [doi]
@article{Cai90a,
title = {The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices},
author = {Mao-cheng Cai},
year = {1990},
doi = {10.1016/0012-365X(90)90161-A},
url = {http://dx.doi.org/10.1016/0012-365X(90)90161-A},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Cai90a},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {85},
number = {1},
pages = {43-52},
}