Yangzhou Hu

most citedOn the Number of Fixed-Length Semiorders

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

An improvement of sufficient condition for $k$ -leaf-connected graphs

Tingyan Ma, Guoyan Ao, Ruifang Liu +2

For integer $k \geq 2,$ a graph $G$ is called $k$ -leaf-connected if $∣ V (G) ∣ \geq k + 1$ and given any subset $S \subseteq V (G)$ with $∣ S ∣ = k,$ $G$ always has a spanning tree $T$ such that…

math.CO2012★ 2 cited

On the Number of Fixed-Length Semiorders

Yangzhou Hu

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$ -element semiorders of length $H$ and $(n + 1)$ …

An improvement of sufficient condition for k-leaf-connected graphs

On the Number of Fixed-Length Semiorders

An improvement of sufficient condition for $k$ -leaf-connected graphs