default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianji Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j14]Xudong Yuan, Tingting Li, Jianji Su:
The Vertices of Lower Degree in Contraction-Critical k-Connected Graphs. Ars Comb. 98: 113-127 (2011)- 2010
- [j13]Tingting Li, Jianji Su:
The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs. Graphs Comb. 26(3): 395-406 (2010)
2000 – 2009
- 2009
- [j12]Tingting Li, Jianji Su:
A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs. Discret. Math. 309(9): 2870-2876 (2009) - [j11]Jianji Su, Xiaofeng Guo, Liqiong Xu:
Removable edges in a k-connected graph and a construction method for k-connected graphs. Discret. Math. 309(10): 3161-3165 (2009) - 2008
- [j10]Chengfu Qin
, Xudong Yuan, Jianji Su:
Some properties of contraction-critical 5-connected graphs. Discret. Math. 308(23): 5742-5756 (2008) - [j9]Min Li, Xudong Yuan, Jianji Su:
The number of vertices of degree 7 in a contraction-critical 7-connected graph. Discret. Math. 308(24): 6262-6268 (2008) - 2006
- [j8]Jianji Su, Xudong Yuan:
A new degree sum condition for the existence of a contractible edge in a kappa-connected graph. J. Comb. Theory B 96(2): 276-295 (2006) - 2005
- [j7]Chengfu Qin, Xudong Yuan, Jianji Su:
Triangles in contraction critical 5-connected graphs. Australas. J Comb. 33: 139-146 (2005) - [j6]Jianji Su, Xudong Yuan:
Contractible Edges in 7-Connected Graphs. Graphs Comb. 21(4): 445-457 (2005) - 2004
- [j5]Jichang Wu, Xueliang Li, Jianji Su:
The number of removable edges in a 4-connected graph. J. Comb. Theory B 92(1): 13-40 (2004) - [j4]Jianji Su:
Proof of Mader's conjecture on k-critical n-connected graphs. J. Graph Theory 45(4): 281-297 (2004)
1990 – 1999
- 1999
- [j3]Jianji Su:
The Number of Removable Edges in 3-Connected Graphs. J. Comb. Theory B 75(1): 74-87 (1999) - 1995
- [j2]Jianji Su:
Fragments in kcritical n-connected graphs. J. Graph Theory 20(3): 287-295 (1995) - 1993
- [j1]Jianji Su:
On locally k-critically n-connected graphs. Discret. Math. 120(1-3): 183-190 (1993)
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 2025-01-09 12:54 CET 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:
