default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChengfu Qin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Guoli Ding, Chengfu Qin
:
Strengthened chain theorems for different versions of 4-connectivity. Discret. Math. 346(1): 113129 (2023)- [j18]Xiaomin Zhou, Weihua Yang, Xiaxia Guan, Chengfu Qin:
A characterization of internally 4-connected {P10 - {V1, V2}}-minor-free graphs. Discuss. Math. Graph Theory 43(3): 731-742 (2023) - 2022
- [j17]Wenyan Jia, Shuai Kou, Weihua Yang, Chengfu Qin:
A Note on Oct1+-Minor-Free Graphs and Oct2+-Minor-Free Graphs. J. Interconnect. Networks 22(4): 2150030:1-2150030:13 (2022) - 2021
- [j16]Shuai Kou, Chengfu Qin, Weihua Yang:
Contractible Edges in 3-Connected Cubic Graphs. Parallel Process. Lett. 31(3): 2150014:1-2150014:5 (2021) - 2020
- [j15]Litao Guo, Chengfu Qin, Liqiong Xu:
Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes. J. Parallel Distributed Comput. 138: 190-198 (2020) - [j14]Chengfu Qin, Weihua Yang:
5-Shredders of Contraction-Critical 5-Connected Graphs. Parallel Process. Lett. 30(3): 2040008:1-2040008:16 (2020)
2010 – 2019
- 2019
- [j13]Chengfu Qin, Litao Guo, Lexian Huang:
Connectivity of the graph induced by contractible edges of a k-tree. Appl. Math. Comput. 353: 1-6 (2019) - [j12]Chengfu Qin, Weihua He, Kiyoshi Ando:
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. Discret. Math. 342(11): 3047-3056 (2019) - [j11]Chengfu Qin, Guoli Ding:
A chain theorem for 4-connected graphs. J. Comb. Theory B 134: 341-349 (2019) - 2015
- [j10]Chengfu Qin, Xiaofeng Guo, Kiyoshi Ando:
The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs. Graphs Comb. 31(1): 243-254 (2015) - 2014
- [j9]Xiaoxia Wu, Lian-zhu Zhang, Hawei Dong, Chengfu Qin:
Height Probabilities in the Abelian Sandpile Model on the Generalized Trees. Ars Comb. 117: 191-216 (2014) - 2013
- [j8]Weihua Yang, Huiqiu Lin, Chengfu Qin:
On the t/k-diagnosability of BC networks. Appl. Math. Comput. 225: 366-371 (2013) - 2012
- [j7]Yingzhi Tian, Litao Guo, Jixiang Meng, Chengfu Qin:
Inverse degree and super edge-connectivity. Int. J. Comput. Math. 89(6): 752-759 (2012) - 2011
- [j6]Kiyoshi Ando, Chengfu Qin:
Some structural properties of minimally contraction-critically 5-connected graphs. Discret. Math. 311(13): 1084-1097 (2011) - [j5]Weihua Yang, Zhao Zhang, Chengfu Qin, Xiaofeng Guo:
On super 2-restricted and 3-restricted edge-connected vertex transitive graphs. Discret. Math. 311(23-24): 2683-2689 (2011) - 2010
- [j4]Chengfu Qin, Xiaofeng Guo:
Contractible edges of k-connected graphs for k = 4, 5. Ars Comb. 97 (2010) - [j3]Litao Guo, Chengfu Qin, Xiaofeng Guo:
Super connectivity of Kronecker products of graphs. Inf. Process. Lett. 110(16): 659-661 (2010)
2000 – 2009
- 2008
- [j2]Chengfu Qin, Xudong Yuan, Jianji Su:
Some properties of contraction-critical 5-connected graphs. Discret. Math. 308(23): 5742-5756 (2008) - 2005
- [j1]Chengfu Qin, Xudong Yuan, Jianji Su:
Triangles in contraction critical 5-connected graphs. Australas. J Comb. 33: 139-146 (2005)
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-10 20:27 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:
