Cai90a'

BibTeX

@article{DBLP:journals/dm/Cai90a,
  author    = {Mao-cheng Cai},
  title     = {The maximal size of graphs with at most k edge-disjoint
               paths connecting any two adjacent vertices},
  journal   = {Discrete Mathematics},
  volume    = {85},
  number    = {1},
  year      = {1990},
  pages     = {43-52},
  ee        = {http://dx.doi.org/10.1016/0012-365X(90)90161-A},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}