![](/img/cover-not-exists.png)
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices
Mao-cheng CaiVolume:
85
Year:
1990
Language:
english
Pages:
10
DOI:
10.1016/0012-365x(90)90161-a
File:
PDF, 502 KB
english, 1990