3 citations · 7 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
A Turán-type problem on distance two
Xueliang Li, Jing Ma, Yongtang Shi +1
A new turán-type problem on distances on graphs was introduced by Tyomkyn and Uzzell. In this paper, we focus on the case that the distance is two. We primely show that for any val…
math.CO2013★ 1 cited
Lower bounds for the spanning tree numbers of two graph products
Hengzhe Li, Xueliang Li, Yaping Mao +1
For any graph of order , the spanning tree packing number \emph{}, is the maximum number of edge-disjoint spanning trees contained in . In this paper, we obtain s…