Tao Tian

works on

graph connectivity 1 graph toughness 1 hamiltonian connectivity 1 independence number 1 k2 ∪ k k1)-free graphs 1 minimum degree 1

From the 1 of 2 linked papers with an AI index.

collaborators

2 papers

math.CO2026

Sufficient conditions for $(K_{2} \cup k K_{1})$ -free graphs to be Hamilton-connected

Xiaoqiong Xu, Shujie Chen, Fengming Dong +1

The paper establishes new sufficient conditions—based on connectivity, minimum degree, toughness, and independence number—for (K₂ ∪ kK₁)-free graphs to be Hamilton‑connected, impro…

math.CO2026

Extremal problems on disjoint path covers of graphs

Shujie Chen, Tao Tian

In 1962, ErdÅs characterized the maximum size of nonhamiltonian graphs of order $n$ with minimum degree at least $k$ . Later, Ning and Peng [Combin. Probab. Comput. 29 (2020) 128-1…

Sufficient conditions for (K2​∪kK1​)-free graphs to be Hamilton-connected

Extremal problems on disjoint path covers of graphs

Sufficient conditions for $(K_{2} \cup k K_{1})$ -free graphs to be Hamilton-connected