|
|||||
|
|
On Extremal Graphs with at Most ell Internally Disjoint Steiner Trees Connecting Any n-1 Vertices |
|
| Authors: | Xueliang Li Yaping Mao |
| Affiliation: | 1. Center for Combinatorics and LPMC, Nankai University, Tianjin, 300071, China 2. Department of Mathematics, Qinghai Normal University, Xining, 810008, Qinghai, China |
| Abstract: | |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |