Long-Tu Yuan

According to our database, Long-Tu Yuan authored at least 17 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Exact generalized Turán numbers for even linear forests.

Ya-Hong Chen, Jia-Bao Yang, Long-Tu Yuan, Ping Zhang

Discret. Math., 2024

2023

The Turán number for the edge blow-up of trees: The missing case.

Cheng Chi, Long-Tu Yuan

Discret. Math., June, 2023

The structure of graphs with given lengths of cycles.

Cheng Chi, Long-Tu Yuan

Discret. Math., 2023

2022

Extremal graphs for edge blow-up of graphs.

Long-Tu Yuan

J. Comb. Theory B, 2022

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique.

Wanfang Chen, Changhong Lu, Long-Tu Yuan

Graphs Comb., 2022

Extremal graphs of the pth power of paths.

Long-Tu Yuan

Eur. J. Comb., 2022

Graphs with large maximum degree containing no edge-critical graphs.

Qingyi Huo, Long-Tu Yuan

Eur. J. Comb., 2022

A note on the 2-power of Hamilton cycles.

Zia Ullah Khan, Long-Tu Yuan

Discret. Math., 2022

2021

Turán numbers for disjoint paths.

Long-Tu Yuan, Xiao-Dong Zhang

J. Graph Theory, 2021

Extremal graphs for odd wheels.

Long-Tu Yuan

J. Graph Theory, 2021

The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths.

Changhong Lu, Long-Tu Yuan, Ping Zhang

Electron. J. Comb., 2021

2020

On the anti-Ramsey numbers of linear forests.

Tian-Ying Xie, Long-Tu Yuan

Discret. Math., 2020

2019

A note on Turán's theorem.

Long-Tu Yuan

Appl. Math. Comput., 2019

2018

Extremal graphs for the k-flower.

Long-Tu Yuan

J. Graph Theory, 2018

2017

A Variation of the Erdős-Sós Conjecture in Bipartite Graphs.

Long-Tu Yuan, Xiao-Dong Zhang

Graphs Comb., 2017

The Turán number of disjoint copies of paths.

Long-Tu Yuan, Xiao-Dong Zhang

Discret. Math., 2017

On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices.

Long-Tu Yuan, Xiao-Dong Zhang

Ars Math. Contemp., 2017