default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSizhong Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j63]Sizhong Zhou, Tao Zhang, Qiuxiang Bian:
A spectral condition for a graph to have strong parity factors. Discret. Appl. Math. 360: 188-195 (2025)- [j62]Sizhong Zhou:
Spectral radius and component factors in graphs. J. Supercomput. 81(1): 120 (2025) - 2024
- [j61]Sizhong Zhou:
Remarks on restricted fractional (g,f)-factors in graphs. Discret. Appl. Math. 354: 271-278 (2024) - [j60]Sizhong Zhou, Yuli Zhang, Hongxia Liu:
Spanning k-trees and distance signless Laplacian spectral radius of graphs. Discret. Appl. Math. 358: 358-365 (2024) - [j59]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) - [j58]Sizhong Zhou, Yuli Zhang, Zhiren Sun:
The A-spectral radius for path-factors in graphs. Discret. Math. 347(5): 113940 (2024) - [j57]Sizhong Zhou, Jiancheng Wu:
Two Sufficient Conditions for Graphs to Admit Path Factors. Fundam. Informaticae 191(1): 67-77 (2024) - [j56]Sizhong Zhou, Hongxia Liu:
Some existence theorems on path-factor critical avoidable graphs. RAIRO Oper. Res. 58(2): 2015-2027 (2024) - [j55]Sizhong Zhou, Jiancheng Wu:
Spanning k-trees and distance spectral radius in graphs. J. Supercomput. 80(16): 23357-23366 (2024) - 2023
- [j54]Sizhong Zhou:
Some results on path-factor critical avoidable graphs. Discuss. Math. Graph Theory 43(1): 233-244 (2023) - [j53]Sizhong Zhou, Qiuxiang Bian, Zhiren Sun:
Two sufficient conditions for component factors in graphs. Discuss. Math. Graph Theory 43(3): 761-766 (2023) - [j52]Sizhong Zhou, Hongxia Liu:
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius. RAIRO Oper. Res. 57(3): 1343-1351 (2023) - [j51]Sizhong Zhou, Yuli Zhang:
Sufficient conditions for graphs to have strong parity factors. RAIRO Oper. Res. 57(5): 2465-2471 (2023) - 2022
- [j50]Sizhong Zhou, Qiuxiang Bian, Quanru Pan:
Path factors in subgraphs. Discret. Appl. Math. 319: 183-191 (2022) - [j49]Sizhong Zhou, Hongxia Liu, Yang Xu:
A note on fractional ID-[a, b]-factor-critical covered graphs. Discret. Appl. Math. 319: 511-516 (2022) - [j48]Sizhong Zhou:
A neighborhood union condition for fractional (a, b, k)-critical covered graphs. Discret. Appl. Math. 323: 343-348 (2022) - [j47]Fan Yang, Liangchen Li, Sizhong Zhou:
Nowhere-zero unoriented 6-flows on certain triangular graphs. Discuss. Math. Graph Theory 42(3): 727-746 (2022) - [j46]Sizhong Zhou:
A Note of Generalization of Fractional ID-factor-critical Graphs. Fundam. Informaticae 187(1): 61-69 (2022) - [j45]Sizhong Zhou, Jiancheng Wu, Hongxia Liu:
Independence number and connectivity for fractional (a, b, k)-critical covered graphs. RAIRO Oper. Res. 56(4): 2535-2542 (2022) - [j44]Sizhong Zhou, Qiuxiang Bian:
The existence of path-factor uniform graphs with large connectivity. RAIRO Oper. Res. 56(4): 2919-2927 (2022) - 2021
- [j43]Sizhong Zhou, Zhiren Sun:
A neighborhood condition for graphs to have restricted fractional (g, f)-factors. Contributions Discret. Math. 16(1): 138-149 (2021) - [j42]Sizhong Zhou:
Binding numbers and restricted fractional (g, f)-factors in graphs. Discret. Appl. Math. 305: 350-356 (2021) - [j41]Sizhong Zhou, Zhiren Sun, Hongxia Liu:
Isolated toughness and path-factor uniform graphs. RAIRO Oper. Res. 55(3): 1279-1290 (2021) - 2020
- [j40]Sizhong Zhou, Tao Zhang, Zurun Xu:
Subgraphs with orthogonal factorizations in graphs. Discret. Appl. Math. 286: 29-34 (2020) - [j39]Sizhong Zhou, Zhiren Sun:
Binding number conditions for P≥2-factor and P≥3-factor uniform graphs. Discret. Math. 343(3): 111715 (2020) - [j38]Guoyuan Yang
, Sizhong Zhou, Jelena Bozek, Hao-Ming Dong, Meizhen Han, Xi-Nian Zuo, Hesheng Liu, Jia-Hong Gao:
Sample sizes and population differences in brain template construction. NeuroImage 206 (2020) - [j37]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) - [j36]Sizhong Zhou:
Remarks on path factors in graphs. RAIRO Oper. Res. 54(6): 1827-1834 (2020)
2010 – 2019
- 2019
- [j35]Sizhong Zhou:
Sun toughness and P≥3-factors in graphs. Contributions Discret. Math. 14(1) (2019) - [j34]Sizhong Zhou, Yang Xu, Zhiren Sun:
Degree conditions for fractional (a, b, k)-critical covered graphs. Inf. Process. Lett. 152 (2019) - [j33]Sizhong Zhou:
Some results about component factors in graphs. RAIRO Oper. Res. 53(3): 723-730 (2019) - 2018
- [j32]Zhiren Sun, Sizhong Zhou:
A generalization of orthogonal factorizations in digraphs. Inf. Process. Lett. 132: 49-54 (2018) - 2017
- [j31]Sizhong Zhou, Yang Xu, Fan Yang:
Toughness for the existence of k-Hamiltonian [a, b]-factors. Ars Comb. 135: 153-161 (2017) - [j30]Jiancheng Wu, Tao Zhang, Sizhong Zhou:
The existence of P≥3-factor covered graphs. Discuss. Math. Graph Theory 37(4): 1055-1065 (2017) - [j29]Sizhong Zhou, Zhiren Sun, Zurun Xu:
A result on r-orthogonal factorizations in digraphs. Eur. J. Comb. 65: 15-23 (2017) - [c2]Sizhong Zhou, Yang Xu, Lan Xu:
Stability Number and k-Hamiltonian [a, b]-factors. CALDAM 2017: 356-361 - [c1]Sizhong Zhou, Tao Zhang, Zurun Xu:
Subgraphs with Orthogonal [0, ki]1n -Factorizations in Graphs. CALDAM 2017: 362-370 - 2016
- [j28]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
- [j27]Sizhong Zhou:
Degree Conditions for Graphs to Be Fractional k-Covered Graphs. Ars Comb. 118: 135-142 (2015) - [j26]Sizhong Zhou:
A new sufficient condition for graphs to be (a, b, k)-critical graphs. Ars Comb. 118: 191-199 (2015) - [j25]Sizhong Zhou, Zhiren Sun, Yang Xu:
A theorem on fractional ID-(g, f)-factor-critical graphs. Contributions Discret. Math. 10(2) (2015) - [j24]Sizhong Zhou, Qiuxiang Bian:
An existence theorem on fractional deleted graphs. Period. Math. Hung. 71(1): 125-133 (2015) - 2014
- [j23]Sizhong Zhou, Jie Wu, Quanru Pan:
A result on fractional ID-[a, b]-factor-critical graphs. Australas. J Comb. 58: 172-177 (2014) - [j22]Sizhong Zhou:
[a, b]-factors With Given Edges In Graphs. Ars Comb. 114: 267-272 (2014) - [j21]Sizhong Zhou, Qiuju Bian:
Subdigraphs with orthogonal factorizations of digraphs (II). Eur. J. Comb. 36: 198-205 (2014) - [j20]Sizhong Zhou:
Remarks on orthogonal factorizations of digraphs. Int. J. Comput. Math. 91(10): 2109-2117 (2014) - 2013
- [j19]Sizhong Zhou:
Minimum Degree, Independence Number and (a, b, k)-Critical Graphs. Ars Comb. 108: 425-430 (2013) - [j18]Sizhong Zhou, Ziming Duan, Bingyuan Pu:
Isolated Toughness and Fractional (g, f)-Factors of Graphs. Ars Comb. 110: 239-247 (2013) - [j17]Sizhong Zhou, Yang Xu, Jiancheng Wu:
Stability number and Minimum Degree for (a, B, k)-Critical graphs. Discret. Math. Algorithms Appl. 5(4) (2013) - [j16]Sizhong Zhou, Zhiren Sun, Hui Ye:
A toughness condition for fractional (k, m)-deleted graphs. Inf. Process. Lett. 113(8): 255-259 (2013) - 2012
- [j15]Sizhong Zhou:
A new neighborhood condition for graphs to be fractional (k, m)-deleted graphs. Appl. Math. Lett. 25(3): 509-513 (2012) - [j14]Sizhong Zhou, Jiashang Jiang:
A New Sufficient Condition for Graphs to Have (g, f)-Factors. Ars Comb. 106: 3-9 (2012) - [j13]Sizhong Zhou:
Orthogonal (g, f)-Factorization in Graphs. Ars Comb. 106: 501-508 (2012) - [j12]Sizhong Zhou, Bingyuan Pu:
A Degree Condition for Graphs to Have (g, f)-Factors. Ars Comb. 107: 307-315 (2012) - 2011
- [j11]Sizhong Zhou:
A sufficient condition for graphs to be fractional (k, m)-deleted graphs. Appl. Math. Lett. 24(9): 1533-1538 (2011) - [j10]Sizhong Zhou, Zurun Xu, Minggang Zong:
Some New Sufficient Conditions for Graphs to be (a, b, k)-Critical Graphs. Ars Comb. 102: 11-20 (2011) - [j9]Sizhong Zhou, Zurun Xu, Ziming Duan:
Binding Number and Fractional k-Factors of Graphs. Ars Comb. 102: 473-481 (2011) - [j8]Sizhong Zhou:
Some new sufficient conditions for graphs to have fractional k-factors. Int. J. Comput. Math. 88(3): 484-490 (2011) - [j7]Sizhong Zhou, Jiashang Jiang:
Toughness and (a, b, k)-critical graphs. Inf. Process. Lett. 111(9): 403-407 (2011) - 2010
- [j6]Sizhong Zhou:
Randomly r-Orthogonal (0, f)-Factorizations of Bipartite (0, mf-(m-1)r)-Graphs. Ars Comb. 96 (2010) - [j5]Sizhong Zhou:
A sufficient condition for a graph to be an (a, b, k)-critical graph. Int. J. Comput. Math. 87(10): 2202-2211 (2010)
2000 – 2009
- 2009
- [j4]Sizhong Zhou:
Independence number, connectivity and (a, b, k)-critical graphs. Discret. Math. 309(12): 4144-4148 (2009) - [j3]Sizhong Zhou, Qiqing Shen:
On fractional (f, n)-critical graphs. Inf. Process. Lett. 109(14): 811-815 (2009) - 2007
- [j2]Sizhong Zhou, Xiuqian Xuan:
Complete-factors and (g, f)-covered graphs. Australas. J Comb. 37: 265-270 (2007) - [j1]Sizhong Zhou:
Randomly r-orthogonal (0, f)-factorizations of (0, mf-m+1)-graphs. Australas. J Comb. 38: 117-126 (2007)
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-21 00:23 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:
