default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunqing Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j22]Junqing Cai
, Huiming Zhai, Zuosong Liang:
Spanning trees with few branch vertices in K1,4-free graphs. Discret. Math. 347(7): 114009 (2024)- 2022
- [j21]Weisheng Zhao, Ruizhi Lin, Junqing Cai:
On construction for trees making the equality hold in Vizing's conjecture. J. Graph Theory 101(3): 397-427 (2022) - [j20]Zuosong Liang, Juan Wang, Junqing Cai, Xinxin Yang:
On the complexity of local-equitable coloring of graphs. Theor. Comput. Sci. 906: 76-82 (2022) - 2019
- [j19]Panpan Wang, Junqing Cai:
Spanning trees with at most 4 leaves in K1, 5-free graphs. Discret. Math. 342(6): 1546-1552 (2019) - 2018
- [j18]Junqing Cai:
Dominating set and hamiltonicity in claw-heavy graphs. Ars Comb. 141: 21-27 (2018) - [j17]Jin Yan, Shaohua Zhang, Junqing Cai:
Fan-type condition on disjoint cycles in a graph. Discret. Math. 341(4): 1160-1165 (2018) - [j16]Junqing Cai, Hao Li, Yuzhong Zhang:
An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian. Inf. Process. Lett. 134: 9-13 (2018) - [j15]Jin Yan, Shaohua Zhang, Yanyan Ren, Junqing Cai:
Degree sum conditions on two disjoint cycles in graphs. Inf. Process. Lett. 138: 7-11 (2018) - 2017
- [j14]Junqing Cai, Lian Yu, Jinzhuan Cai:
Implicit degree sum condition for long cycles. Ars Comb. 130: 143-149 (2017) - [j13]Junqing Cai, Hao Li, Qiang Sun:
Longest cycles in 4-connected graphs. Discret. Math. 340(12): 2955-2966 (2017) - 2016
- [j12]Junqing Cai, Yuzhong Zhang:
Forbidden subgraph conditions for Hamilton cycles in implicit claw-heavy graphs. Ars Comb. 126: 383-393 (2016) - [j11]Junqing Cai, Hao Li:
Hamilton Cycles in Implicit 2-Heavy Graphs. Graphs Comb. 32(4): 1329-1337 (2016) - [j10]Junqing Cai, Yuzhong Zhang:
Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs. Inf. Process. Lett. 116(11): 668-673 (2016) - 2015
- [j9]Junqing Cai:
An algorithm for hamiltonian cycles under implicit degree conditions. Ars Comb. 121: 305-313 (2015) - [j8]Junqing Cai:
A sufficient condition involving implicit degree and neighborhood intersection for long cycles. Inf. Process. Lett. 115(2): 225-227 (2015) - 2014
- [j7]Junqing Cai:
An implicit σ3 type condition for heavy cycles in weighted graphs. Ars Comb. 115: 211-218 (2014) - [j6]Junqing Cai, Hao Li:
A new sufficient condition for pancyclability of graphs. Discret. Appl. Math. 162: 142-148 (2014) - [j5]Junqing Cai, Hao Li, Wantao Ning:
An implicit weighted degree condition for heavy cycles. Discuss. Math. Graph Theory 34(4): 801-810 (2014) - 2013
- [j4]Junqing Cai, Hao Li, Wantao Ning:
An implicit degree condition for hamiltonian cycles. Ars Comb. 108: 365-378 (2013) - [j3]Hao Li, Junqing Cai, Wantao Ning:
An Implicit Degree Condition for Pancyclicity of Graphs. Graphs Comb. 29(5): 1459-1469 (2013) - 2012
- [j2]Huawei Dai, Junqing Cai:
An implicit degree Dirac condition for hamiltonian cycles. Ars Comb. 107: 445-453 (2012) - [j1]Hao Li, Wantao Ning, Junqing Cai:
An implicit degree condition for hamiltonian graphs. Discret. Math. 312(14): 2190-2196 (2012)
Conference and Workshop Papers
- 2011
- [c1]Hao Li, Wantao Ning, Junqing Cai:
An Implicit Degree Condition for Cyclability in Graphs. FAW-AAIM 2011: 82-89
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-06-03 01:01 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:
