default search action
Li-gang Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Ligang Jin
, Yu Men
Robot Skill Generalization: Feature-Selected Adaptation Transfer for Peg-in-Hole Assembly. IEEE Trans. Ind. Electron. 71(3): 2748-2757 (2024) - [j16]Ligang Jin
Ensemble Transfer Strategy Based on Domain Difference for Robot Multiple Peg-in-Hole Assembly. IEEE Trans. Ind. Electron. 71(10): 12645-12654 (2024) - [i1]Ligang Jin, Eckhard Steffen:
Information dissemination and confusion in signed networks. CoRR abs/2407.09796 (2024) - 2023
- [j15]Yu Men
Policy Fusion Transfer: The Knowledge Transfer for Different Robot Peg-in-Hole Insertion Assemblies. IEEE Trans. Instrum. Meas. 72: 1-10 (2023) - 2022
- [j14]Yingli Kang, Xiaoyue Chen, Ligang Jin
A study on parity signed graphs: The rna number. Appl. Math. Comput. 431: 127322 (2022) - [j13]Yingli Kang, Ligang Jin
(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6. Discret. Math. 345(4): 112758 (2022) - 2021
- [j12]Ligang Jin, Tsai-Lien Wong, Xuding Zhu
Colouring of S-labelled planar graphs. Eur. J. Comb. 92: 103198 (2021) - [j11]Ligang Jin, Ying-li Kang:
Partially normal 5-edge-colorings of cubic graphs. Eur. J. Comb. 95: 103327 (2021)
2010 – 2019
- 2018
- [j10]Ligang Jin, Giuseppe Mazzuoccolo
Cores, joins and the Fano-flow conjectures. Discuss. Math. Graph Theory 38(1): 165-175 (2018) - 2017
- [j9]Ligang Jin, Eckhard Steffen
Petersen Cores and the Oddness of Cubic Graphs. J. Graph Theory 84(2): 109-120 (2017) - [j8]Ligang Jin, Ying-li Kang, Michael Schubert, Yingqian Wang:
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable. SIAM J. Discret. Math. 31(3): 1836-1847 (2017) - 2016
- [j7]Ligang Jin, Ying-li Kang, Eckhard Steffen:
Face-Degree Bounds for Planar Critical Graphs. Electron. J. Comb. 23(3): 3 (2016) - [j6]Ligang Jin, Ying-li Kang, Eckhard Steffen
Remarks on planar edge-chromatic critical graphs. Discret. Appl. Math. 200: 200-202 (2016) - [j5]Ying-li Kang, Ligang Jin, Yingqian Wang
The 3-colorability of planar graphs without cycles of length 4, 6 and 9. Discret. Math. 339(1): 299-307 (2016) - [j4]Ligang Jin, Ying-li Kang, Eckhard Steffen
Choosability in signed planar graphs. Eur. J. Comb. 52: 234-243 (2016) - 2013
- [j3]Ying-li Kang, Yi Zhang, Li-gang Jin:
Soliton solution to BKP equation in Wronskian form. Appl. Math. Comput. 224: 250-258 (2013) - 2012
- [j2]Yi Zhang, Li-gang Jin, Kang-hui Dong:
Integrable discretizations and soliton solution of KdV and mKdV equations. Appl. Math. Comput. 218(18): 9555-9562 (2012) - [j1]Yi Zhang, Li-gang Jin, Ying-li Kang:
Generalized Wronskian solutions for the (3 + 1)-dimensional Jimbo-Miwa equation. Appl. Math. Comput. 219(5): 2601-2610 (2012)
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-09-10 01:15 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: