![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Zhiren Sun
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Guangfeng Li, Jian Sun, Zhiren Sun, Donglei Du, Xiaoyan Zhang:
An approximation algorithm for high-dimensional table compression on balanced K-partite graph. Comput. Electr. Eng. 113: 109048 (2024) - [j19]Sizhong Zhou, Zhiren Sun, Hongxia Liu:
D-index and Q-index for spanning trees with leaf degree at most k in graphs. Discret. Math. 347(5): 113927 (2024) - [j18]Sizhong Zhou, Yuli Zhang, Zhiren Sun:
The A-spectral radius for path-factors in graphs. Discret. Math. 347(5): 113940 (2024) - 2023
- [j17]Sizhong Zhou, Qiuxiang Bian, Zhiren Sun:
Two sufficient conditions for component factors in graphs. Discuss. Math. Graph Theory 43(3): 761-766 (2023) - 2021
- [j16]Sizhong Zhou, Zhiren Sun:
A neighborhood condition for graphs to have restricted fractional (g, f)-factors. Contributions Discret. Math. 16(1): 138-149 (2021) - [j15]Sizhong Zhou, Zhiren Sun, Hongxia Liu:
Isolated toughness and path-factor uniform graphs. RAIRO Oper. Res. 55(3): 1279-1290 (2021) - 2020
- [j14]Sizhong Zhou, Zhiren Sun:
Binding number conditions for P≥2-factor and P≥3-factor uniform graphs. Discret. Math. 343(3): 111715 (2020) - [j13]Sizhong Zhou, Zhiren Sun, Q. Pan:
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs. Probl. Inf. Transm. 56(4): 332-344 (2020)
2010 – 2019
- 2019
- [j12]Sizhong Zhou, Yang Xu, Zhiren Sun:
Degree conditions for fractional (a, b, k)-critical covered graphs. Inf. Process. Lett. 152 (2019) - 2018
- [j11]Zhiren Sun, Sizhong Zhou:
A generalization of orthogonal factorizations in digraphs. Inf. Process. Lett. 132: 49-54 (2018) - 2017
- [j10]Sizhong Zhou, Zhiren Sun, Zurun Xu:
A result on r-orthogonal factorizations in digraphs. Eur. J. Comb. 65: 15-23 (2017) - 2016
- [j9]Zhiren Sun, Fan Yang, Sizhong Zhou:
A neighborhood condition for fractional ID-[a, b]-factor-critical graphs. Discuss. Math. Graph Theory 36(2): 409-418 (2016) - 2015
- [j8]Sizhong Zhou, Zhiren Sun, Yang Xu:
A theorem on fractional ID-(g, f)-factor-critical graphs. Contributions Discret. Math. 10(2) (2015) - 2014
- [j7]Yuan Yuan, Zhiren Sun:
Toughness and Degree condition for fractional ID-k-factor-Critical graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - 2013
- [j6]Sizhong Zhou, Zhiren Sun, Hui Ye:
A toughness condition for fractional (k, m)-deleted graphs. Inf. Process. Lett. 113(8): 255-259 (2013) - [i1]Daqiang Zhang, Qin Zou, Zhiren Sun:
SECA: Snapshot-based Event Detection for Checking Asynchronous Context Consistency in Ubiquitous Computing. CoRR abs/1305.3105 (2013)
2000 – 2009
- 2008
- [j5]Haihui Zhang, Zhiren Sun:
On 3-choosability of planar graphs without certain cycles. Inf. Process. Lett. 107(3-4): 102-106 (2008) - 2006
- [j4]Haihui Zhang, Baogang Xu, Zhiren Sun:
Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable. Ars Comb. 80 (2006) - 2001
- [j3]Zhiren Sun, Feng Tian, Bing Wei
:
Degree Sums, Connectivity and Dominating Cycles in Graphs. Graphs Comb. 17(3): 555-564 (2001) - [j2]Zhiren Sun, Feng Tian, Bing Wei
:
Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. Graphs Comb. 17(3): 565-577 (2001)
1990 – 1999
- 1998
- [j1]Hao Li, Mei Lu, Zhiren Sun:
Hamiltonicity in 2-connected graphs with claws. Discret. Math. 183(1-3): 223-236 (1998)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-21 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint