Hengzhe Li

activity

20102020

most citedOn extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices

21 citations · 59 across the 14 of their papers we have counts for

collaborators

Showing 2012Show all

3 papers · 1 filter

math.CO2012★ 21 cited

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, $h (n; κ ˉ \geq r)$ , which guarantees that any graph with $n$ vertices and $h (n; κ ˉ \geq r)$ edges will contain a pair of v…

math.CO2012

Note on minimally $k$ -rainbow connected graphs

Hengzhe Li, Xueliang Li, Yuefang Sun +1

An edge-colored graph $G$ , where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct col…

math.CO2012

Graphs with large generalized 3-connectivity

Hengzhe Li, Xueliang Li, Yaping Mao +1

Let $S$ be a nonempty set of vertices of a connected graph $G$ . A collection $T_{1}, ..., T_{ℓ}$ of trees in $G$ is said to be internally disjoint trees connecting $S$ if $E(T_i)\cap…

On extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices

Note on minimally k-rainbow connected graphs

Graphs with large generalized 3-connectivity

Note on minimally $k$ -rainbow connected graphs