Isolated toughness and path-factor uniform graphs
RAIRO-Oper. Res., 55 3 (2021) 1279-1290
Published online: 2021-05-19
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Tight Toughness, Isolated Toughness and Binding Number Bounds for the [1,n]-Factors and the {K2,Ci≥4}-Factors
Xiao Xu, Zhuoma Gao, Lei Meng and Qinghe TongJournal of Interconnection Networks 24 (01) (2024)
https://doi.org/10.1142/S021926592350010X
Tight toughness, isolated toughness and binding number bounds for the path factors
Yue Li, Fengyun Ren, Xin Xu and Qinghe TongInternational Journal of Computer Mathematics: Computer Systems Theory 8 (3) 143 (2023)
https://doi.org/10.1080/23799927.2023.2190038
Isolated toughness and path-factor uniform graphs (II)
Sizhong Zhou, Zhiren Sun and Qiuxiang BianIndian Journal of Pure and Applied Mathematics 54 (3) 689 (2023)
https://doi.org/10.1007/s13226-022-00286-x
Toughness and binding number bounds of star-like and path factor
Xinge Feng and Xingchao DengRAIRO - Operations Research 57 (3) 1167 (2023)
https://doi.org/10.1051/ro/2023057
On the existence of {K1,1,K1,2,Ct}-factor—From high-dimensional space perspective
Meihui Lan and Wei GaoInternational Journal of Cognitive Computing in Engineering 3 31 (2022)
https://doi.org/10.1016/j.ijcce.2022.01.002
Path factors in subgraphs
Sizhong Zhou, Qiuxiang Bian and Quanru PanDiscrete Applied Mathematics 319 183 (2022)
https://doi.org/10.1016/j.dam.2021.04.012
TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
SIZHONG ZHOU, JIANCHENG WU and YANG XUBulletin of the Australian Mathematical Society 106 (2) 195 (2022)
https://doi.org/10.1017/S0004972721000952
The existence of path-factor uniform graphs with large connectivity
Sizhong Zhou and Qiuxiang BianRAIRO - Operations Research 56 (4) 2919 (2022)
https://doi.org/10.1051/ro/2022143
A neighborhood union condition for fractional (a,b,k)-critical covered graphs
Sizhong ZhouDiscrete Applied Mathematics 323 343 (2022)
https://doi.org/10.1016/j.dam.2021.05.022
An existence theorem on fractional ID-(g, f)-factor-critical covered graphs
Jiashang JiangAKCE International Journal of Graphs and Combinatorics 19 (1) 31 (2022)
https://doi.org/10.1080/09728600.2021.2010026
On path-factor critical deleted (or covered) graphs
Sizhong Zhou, Jiancheng Wu and Qiuxiang BianAequationes mathematicae 96 (4) 795 (2022)
https://doi.org/10.1007/s00010-021-00852-4
Component factors and binding number conditions in graphs
Sizhong Zhou, Jiang Xu and Lan XuAIMS Mathematics 6 (11) 12460 (2021)
https://doi.org/10.3934/math.2021719
Nash-Williams conditions for the existence of all fractional [a, b]-factors
Zhiren Sun and Sizhong ZhouIndian Journal of Pure and Applied Mathematics 52 (2) 542 (2021)
https://doi.org/10.1007/s13226-021-00054-3
A Result on Fractional (a, b, k)-critical Covered Graphs
Si-zhong ZhouActa Mathematicae Applicatae Sinica, English Series 37 (4) 657 (2021)
https://doi.org/10.1007/s10255-021-1034-8