Hongyuan Lai

activity

20142026

most citedCharacterizations of minimal graphs with equal edge connectivity and spanning tree packing number

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

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

Yingzhi Tian, Hong-Jian Lai, Liqiong Xu +1

Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$ , every $k$ -connected, finite graph $G$ with $δ(G)\g…

math.CO2017★ 1 cited

Connectivity keeping stars or double-stars in 2-connected graphs

Yingzhi Tian, Jixiang Meng, Hong-Jian Lai +1

In [W. Mader, Connectivity keeping paths in $k$ -connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ …

math.CO2017★ 1 cited

A note on edge degree and spanning trail containing given edges

Weihua Yang, Hong-jian Lai, Baoyindureng Wu

Let $G$ be a simple graph with $n \geq 4$ vertices and $d (x) + d (y) \geq n + k$ for each edge $x y \in E (G)$ . In this work we prove that $G$ either contains a spanning closed trail containi…