default search action
Long-Tu Yuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Jia-Bao Yang, Long-Tu Yuan:
A note on the stability results of the number of cliques in graphs with given matching number. Discret. Appl. Math. 356: 343-349 (2024) - [j20]Ya-Hong Chen, Jia-Bao Yang, Long-Tu Yuan, Ping Zhang:
Exact generalized Turán numbers for even linear forests. Discret. Math. 347(7): 113974 (2024) - [j19]Long-Tu Yuan, Xiao-Dong Zhang:
Extremal graphs for even linear forests in bipartite graphs. Discuss. Math. Graph Theory 44(1): 5 (2024) - [j18]Jie Ma, Long-Tu Yuan:
A Stability Result of the Pósa Lemma. SIAM J. Discret. Math. 38(2): 1757-1783 (2024) - [j17]Jialei Song, Changhong Lu, Long-Tu Yuan
:
On the Turán Number of Edge Blow-Ups of Cliques. SIAM J. Discret. Math. 38(3): 2429-2446 (2024) - 2023
- [j16]Cheng Chi
The structure of graphs with given lengths of cycles. Discret. Math. 346(1): 113215 (2023) - [j15]Cheng Chi, Long-Tu Yuan
The Turán number for the edge blow-up of trees: The missing case. Discret. Math. 346(6): 113370 (2023) - 2022
- [j14]Zia Ullah Khan
A note on the 2-power of Hamilton cycles. Discret. Math. 345(8): 112908 (2022) - [j13]Long-Tu Yuan:
Extremal graphs of the pth power of paths. Eur. J. Comb. 104: 103548 (2022) - [j12]Qingyi Huo, Long-Tu Yuan:
Graphs with large maximum degree containing no edge-critical graphs. Eur. J. Comb. 106: 103576 (2022) - [j11]Wanfang Chen, Changhong Lu, Long-Tu Yuan
Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. Graphs Comb. 38(3): 67 (2022) - [j10]Long-Tu Yuan:
Extremal graphs for edge blow-up of graphs. J. Comb. Theory B 152: 379-398 (2022) - 2021
- [j9]Changhong Lu, Long-Tu Yuan, Ping Zhang:
The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths. Electron. J. Comb. 28(4) (2021) - [j8]Long-Tu Yuan, Xiao-Dong Zhang
Turán numbers for disjoint paths. J. Graph Theory 98(3): 499-524 (2021) - [j7]Long-Tu Yuan:
Extremal graphs for odd wheels. J. Graph Theory 98(4): 691-707 (2021) - 2020
- [j6]Tian-Ying Xie
On the anti-Ramsey numbers of linear forests. Discret. Math. 343(12): 112130 (2020)
2010 – 2019
- 2019
- [j5]Long-Tu Yuan:
A note on Turán's theorem. Appl. Math. Comput. 361: 13-14 (2019) - 2018
- [j4]Long-Tu Yuan:
Extremal graphs for the k-flower. J. Graph Theory 89(1): 26-39 (2018) - 2017
- [j3]Long-Tu Yuan, Xiao-Dong Zhang:
On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices. Ars Math. Contemp. 13(1): 49-61 (2017) - [j2]Long-Tu Yuan, Xiao-Dong Zhang:
The Turán number of disjoint copies of paths. Discret. Math. 340(2): 132-139 (2017) - [j1]Long-Tu Yuan, Xiao-Dong Zhang:
A Variation of the Erdős-Sós Conjecture in Bipartite Graphs. Graphs Comb. 33(2): 503-526 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: