On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices

Xueliang Li, Yaping Mao. On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. Graphs and Combinatorics, 31(6):2231-2259, 2015. [doi]

Abstract

Abstract is missing.