default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYongxin Lan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Lei Ren, Yongxin Lan, Changqing Xu:
The rainbow numbers of cycles in maximal bipartite planar graph. Discret. Appl. Math. 356: 37-43 (2024)- [j16]Yongxin Lan, Yongtang Shi, Zi-Xia Song:
Planar Turán Numbers of Cubic Graphs and Disjoint Union of Cycles. Graphs Comb. 40(2): 28 (2024) - 2022
- [j15]Yifan Pei, Yongxin Lan, Hua He:
Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs. Appl. Math. Comput. 418: 126843 (2022) - [j14]Changyuan Xiang, Yongxin Lan, Qinghua Yan, Changqing Xu:
The Outer-Planar Anti-Ramsey Number of Matchings. Symmetry 14(6): 1252 (2022) - 2021
- [j13]Zhongmei Qin, Shasha Li, Yongxin Lan, Jun Yue:
Rainbow numbers for paths in planar graphs. Appl. Math. Comput. 397: 125918 (2021) - [j12]Zhongmei Qin
, Yongxin Lan, Yongtang Shi, Jun Yue:
Exact rainbow numbers for matchings in plane triangulations. Discret. Math. 344(4): 112301 (2021)
2010 – 2019
- 2019
- [j11]Yongxin Lan, Tao Li, Hua Wang, Chengyi Xia:
A note on extremal trees with degree conditions. Appl. Math. Comput. 341: 70-79 (2019) - [j10]Yongxin Lan, Tao Li, Yongtang Shi, Jianhua Tu:
The Turán number of star forests. Appl. Math. Comput. 348: 270-274 (2019) - [j9]Yongxin Lan, Yongtang Shi, Zi-Xia Song:
Extremal H-Free Planar Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j8]Zhongmei Qin, Yongxin Lan, Yongtang Shi:
Improved bounds for rainbow numbers of matchings in plane triangulations. Discret. Math. 342(1): 221-225 (2019) - [j7]Yongxin Lan, Henry Liu, Zhongmei Qin, Yongtang Shi:
Degree powers in graphs with a forbidden forest. Discret. Math. 342(3): 821-835 (2019) - [j6]Gang Chen, Yongxin Lan, Zi-Xia Song:
Planar anti-Ramsey numbers of matchings. Discret. Math. 342(7): 2106-2111 (2019) - [j5]Yongxin Lan, Yongtang Shi, Zi-Xia Song:
Planar anti-Ramsey numbers of paths and cycles. Discret. Math. 342(11): 3216-3224 (2019) - [j4]Yongxin Lan, Yongtang Shi, Zi-Xia Song:
Extremal Theta-free planar graphs. Discret. Math. 342(12) (2019) - [j3]Yongxin Lan, Zhongmei Qin, Yongtang Shi:
The Turán number of 2P7. Discuss. Math. Graph Theory 39(4): 805-814 (2019) - [j2]Yongxin Lan, Yongtang Shi:
Planar Turán Numbers of Short Paths. Graphs Comb. 35(5): 1035-1049 (2019) - 2018
- [j1]Yongxin Lan, Tao Li, Yuede Ma, Yongtang Shi, Hua Wang:
Vertex-based and edge-based centroids of graphs. Appl. Math. Comput. 331: 445-456 (2018)
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-08-14 23:14 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:
