Get started
Award

12101126

Funded outputs count: 11
Funder award ID: 12101126
OpenAlex ID: G7680111368
Sufficient conditions for $(K_2 \cup kK_1)$-free graphs to be Hamilton-connected
2026 · Xu, Xiaoqiong, Chen, Shujie, et al. · arXiv (Cornell University)
PDF
Extremal problems on disjoint path covers of graphs
2026 · Chen, Shujie, Tian, Tao · arXiv (Cornell University)
PDF
Spectral and size conditions for spanning k-trees in tough graphs
2026 · Liang, Siyuan, Tian, Tao · arXiv (Cornell University)
PDF
Spanning fan-connectivity of K1,r-free split graphs
2026 · Shujie Chen, Tao Tian · Discrete Mathematics
On sufficient degree conditions for a graph to be disjoint path coverable
2026 · Shujie Chen, Tao Tian · Discrete Applied Mathematics
Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
2026 · Tian, Tao, Dong, Fengming · arXiv (Cornell University)
PDF
Chvátal-Erdős condition for 2-factors with at most two components in graphs
2026 · Tian, Tao, Xiong, Liming, et al. · arXiv (Cornell University)
PDF
Resistance distance and spanning trees of generalized multiple complete split-like graph
2025 · Chenlin Yang, Tao Tian, et al. · Discrete Applied Mathematics · 2
Resistance Distance and Spanning Trees of Multiple Extended Complete Split-Like Graph
2025 · Chenlin Yang, Tao Tian · Circuits Systems and Signal Processing · 2
Counting spanning trees of multiple complete split-like graph containing a given spanning forest
2024 · Chenlin Yang, Tao Tian · Discrete Mathematics · 10
Resistance Between Two Nodes of a Ring Clique Network
2021 · Shuli Li, Tao Tian · Circuits Systems and Signal Processing · 11
Year
Topic