default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZemin Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Zemin Jin, Qing Jie, Zhenxin Cao
:
Rainbow disjoint union of P4 and a matching in complete graphs. Appl. Math. Comput. 474: 128679 (2024)- [j41]Zemin Jin, Rui Yu, Yuefang Sun:
Anti-Ramsey number of matchings in outerplanar graphs. Discret. Appl. Math. 345: 125-135 (2024) - [j40]Zemin Jin, Weijia Zhou, Ting Yu, Yuefang Sun:
Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs. Discret. Math. 347(7): 114011 (2024) - [j39]Zemin Jin, Junqi Gu:
Rainbow disjoint union of clique and matching in edge-colored complete graph. Discuss. Math. Graph Theory 44(3): 953 (2024) - 2023
- [j38]Zemin Jin, Yite Wang, Huawei Ma, Huaping Wang:
Computing the anti-Ramsey number for trees in complete tripartite graph. Appl. Math. Comput. 456: 128151 (2023) - [j37]Yuefang Sun, Zemin Jin:
Semicomplete compositions of digraphs. Discret. Math. 346(8): 113420 (2023) - 2022
- [j36]Zemin Jin, Huawei Ma, Rui Yu:
Rainbow matchings in an edge-colored planar bipartite graph. Appl. Math. Comput. 432: 127356 (2022) - [j35]Yuefang Sun, Zemin Jin:
Minimally strong subgraph (k, ℓ)-arc-connected digraphs. Discuss. Math. Graph Theory 42(3): 759-770 (2022) - 2021
- [j34]Zemin Jin, Xueyao Gui, Kaijun Wang:
Multicolorful connectivity of trees. Appl. Math. Comput. 402: 126147 (2021) - [j33]Zemin Jin:
Anti-Ramsey number of matchings in a hypergraph. Discret. Math. 344(12): 112594 (2021) - [j32]Zemin Jin, Bin Sheng, Yuefang Sun:
The minimum size of a graph with given tree connectivity. Discuss. Math. Graph Theory 41(2): 409-425 (2021) - [j31]Zemin Jin, Kangyun Zhong, Yuefang Sun:
Anti-Ramsey Number of Triangles in Complete Multipartite Graphs. Graphs Comb. 37(3): 1025-1044 (2021) - 2020
- [j30]Zemin Jin, Fang Wang, Huaping Wang, Bihong Lv:
Rainbow triangles in edge-colored Kneser graphs. Appl. Math. Comput. 365 (2020) - [j29]Zemin Jin, Xueliang Li, Yirong Yang:
Extremal graphs with maximum monochromatic connectivity. Discret. Math. 343(9): 111968 (2020)
2010 – 2019
- 2018
- [j28]Zemin Jin, Kun Ye:
Rainbow number of matchings in planar graphs. Discret. Math. 341(10): 2846-2858 (2018) - [j27]Zemin Jin, Kun Ye, He Chen, Yuefang Sun:
Large rainbow matchings in semi-strong edge-colorings of graphs. Discret. Math. Algorithms Appl. 10(2): 1850021:1-1850021:9 (2018) - [j26]Zemin Jin, Fengwei Li, Yuefang Sun:
On two generalized connectivities of graphs. Discuss. Math. Graph Theory 38(1): 245-261 (2018) - [j25]Zemin Jin, Yuefang Sun, Jianhua Tu:
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number. Discuss. Math. Graph Theory 38(4): 1023-1036 (2018) - [j24]Zemin Jin, Kecai Ye, Yuefang Sun, He Chen:
Rainbow matchings in edge-colored complete split graphs. Eur. J. Comb. 70: 297-316 (2018) - 2017
- [j23]Zemin Jin:
Anti-Ramsey numbers for matchings in 3-regular bipartite graphs. Appl. Math. Comput. 292: 114-119 (2017) - [j22]He Chen, Zemin Jin:
Coupon coloring of cographs. Appl. Math. Comput. 308: 90-95 (2017) - [j21]Yuefang Sun, Zemin Jin, Fengwei Li:
On total rainbow k-connected graphs. Appl. Math. Comput. 311: 223-227 (2017) - [j20]Sherry H. F. Yan, Guizhi Qin, Zemin Jin, Robin D. P. Zhou:
On (2k+1, 2k+3)-core partitions with distinct parts. Discret. Math. 340(6): 1191-1202 (2017) - [j19]Zemin Jin, Oothan Nweit, Kaijun Wang, Yuling Wang:
Anti-Ramsey numbers for matchings in regular bipartite graphs. Discret. Math. Algorithms Appl. 9(2): 1750019:1-1750019:7 (2017) - [j18]Zemin Jin, Yuping Zang:
Anti-Ramsey coloring for matchings in complete bipartite graphs. J. Comb. Optim. 33(1): 1-12 (2017) - [j17]Zemin Jin, Yuefang Sun, Sherry H. F. Yan, Yuping Zang:
Extremal coloring for the anti-Ramsey problem of matchings in complete graphs. J. Comb. Optim. 34(4): 1012-1028 (2017) - 2016
- [j16]Jianhua Tu, Zemin Jin:
An FPT algorithm for the vertex cover P4 problem. Discret. Appl. Math. 200: 186-190 (2016) - 2014
- [j15]Zemin Jin, Peipei Zhu:
Heterochromatic tree partition number in complete multipartite graphs. J. Comb. Optim. 28(2): 321-340 (2014) - 2013
- [j14]Zemin Jin, Lifen Li:
Edge-colorings of complete bipartite graphs without large rainbow trees. Ars Comb. 111: 75-84 (2013) - 2012
- [j13]Zemin Jin, Shili Wen, Shujun Zhou:
Heterochromatic tree partition problem in complete tripartite graphs. Discret. Math. 312(4): 789-802 (2012)
2000 – 2009
- 2009
- [j12]Zemin Jin, Sherry H. F. Yan:
Trees with the second and third largest number of maximal independent sets. Ars Comb. 93 (2009) - [j11]Zemin Jin, Xueliang Li:
Anti-Ramsey Numbers for Graphs with Independent Cycles. Electron. J. Comb. 16(1) (2009) - [j10]Xueliang Li, Jianhua Tu, Zemin Jin:
Bipartite rainbow numbers of matchings. Discret. Math. 309(8): 2575-2578 (2009) - 2008
- [j9]He Chen, Zemin Jin, Xueliang Li, Jianhua Tu:
Heterochromatic tree partition numbers for complete bipartite graphs. Discret. Math. 308(17): 3871-3878 (2008) - [j8]Zemin Jin, Xueliang Li:
Graphs with the second largest number of maximal independent sets. Discret. Math. 308(23): 5864-5870 (2008) - 2007
- [j7]Zemin Jin, Huifang Yan, Qinglin Yu:
Generalization of matching extensions in graphs (II). Discret. Appl. Math. 155(10): 1267-1274 (2007) - [j6]Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
Contractible subgraphs in k-connected graphs. J. Graph Theory 55(2): 121-136 (2007) - 2006
- [j5]Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
Contractible Cliques in k-Connected Graphs. Graphs Comb. 22(3): 361-370 (2006) - [j4]Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei:
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11(4): 445-454 (2006) - [j3]Zemin Jin, Xueliang Li:
On the k-path cover problem for cacti. Theor. Comput. Sci. 355(3): 354-363 (2006) - 2004
- [j2]Zemin Jin, Xueliang Li:
On a conjecture on k-walks of graphs. Australas. J Comb. 29: 135-142 (2004) - [j1]Zemin Jin, Xueliang Li:
The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math. 81(11): 1357-1362 (2004)
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-07-09 22:02 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:
