Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Abstract is missing.