On Extremal Graphs with at Most $$\ell $$ ℓ Internally Disjoint Steiner Trees Connecting Any $$n-1$$ n - 1 Vertices
Crossref DOI link: https://doi.org/10.1007/s00373-014-1500-7
Published Online: 2015-01-03
Published Print: 2015-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Li, Xueliang
Mao, Yaping
Text and Data Mining valid from 2015-01-03