21 citations · 59 across the 14 of their papers we have counts for
14 papers
Bounds for Gallai-Ramsey functions and numbers
Zhao Wang, Yaping Mao, Ran Gu +2
For two graphs and a positive integer , the \emph{Gallai-Ramsey number} is defined as the minimum number of vertices such that any -edge-…
The Steiner 4-diameter of a graph
Zhao Wang, Yaping Mao, Hengzhe Li +1
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected…
Algorithm on rainbow connection for maximal outerplanar graphs
Xingchao Deng, Hengzhe Li, Guiying Yan
In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) , we give sufficient conditions to guarantee that $…
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…
On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices
Hengzhe Li, Xueliang Li, Yaping Mao
The problem of determining the smallest number of edges, , which guarantees that any graph with vertices and edges will contain a pair of v…
Note on minimally -rainbow connected graphs
Hengzhe Li, Xueliang Li, Yuefang Sun +1
An edge-colored graph , where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of are connected by a path whose edge has distinct col…