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:

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 Tong
Journal of Interconnection Networks 24 (01) (2024)
https://doi.org/10.1142/S021926592350010X

Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor

Yifan Yao, Jinxia Liang, Yue Li and Rongrong Ma
Journal of Interconnection Networks 24 (03) (2024)
https://doi.org/10.1142/S0219265923500202

On graph-based network parameters and component factors in networks

Ting Jin, Tongtong Hu, Guowei Dai, Kunqi Su and Shijun Xiao
RAIRO - Operations Research 58 (4) 3337 (2024)
https://doi.org/10.1051/ro/2024132

Component factors and degree sum conditions in graphs

Hui Qin, Guowei Dai, Yuan Chen, Ting Jin and Yuan Yuan
RAIRO - Operations Research 58 (5) 3849 (2024)
https://doi.org/10.1051/ro/2024170

Tight toughness, isolated toughness and binding number bounds for the path factors

Yue Li, Fengyun Ren, Xin Xu and Qinghe Tong
International Journal of Computer Mathematics: Computer Systems Theory 8 (3) 143 (2023)
https://doi.org/10.1080/23799927.2023.2190038

Remarks on component factors in K1,r-free graphs

Guowei Dai, Zan-Bo Zhang and Xiaoyan Zhang
RAIRO - Operations Research 57 (2) 837 (2023)
https://doi.org/10.1051/ro/2023042

TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

SIZHONG ZHOU, JIANCHENG WU and YANG XU
Bulletin of the Australian Mathematical Society 106 (2) 195 (2022)
https://doi.org/10.1017/S0004972721000952

Isolated toughness and path-factor uniform graphs

Sizhong Zhou, Zhiren Sun and Hongxia Liu
RAIRO - Operations Research 55 (3) 1279 (2021)
https://doi.org/10.1051/ro/2021061

Tight bounds for the existence of path factors in network vulnerability parameter settings

Wei Gao, Weifan Wang and Yaojun Chen
International Journal of Intelligent Systems 36 (3) 1133 (2021)
https://doi.org/10.1002/int.22335

Some degree conditions for 𝒫≥k-factor covered graphs

Guowei Dai, Zan-Bo Zhang, Yicheng Hang and Xiaoyan Zhang
RAIRO - Operations Research 55 (5) 2907 (2021)
https://doi.org/10.1051/ro/2021140

A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs

S. Zhou, Z. Sun and Q. Pan
Problems of Information Transmission 56 (4) 332 (2020)
https://doi.org/10.1134/S0032946020040043

Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs

Darko Dimitrov and Hosam Abdo
Discrete & Continuous Dynamical Systems - S 12 (4-5) 711 (2019)
https://doi.org/10.3934/dcdss.2019045

Neighborhood Conditions for Fractional ID-k-factor-critical Graphs

Si-zhong Zhou and Zhi-ren Sun
Acta Mathematicae Applicatae Sinica, English Series 34 (3) 636 (2018)
https://doi.org/10.1007/s10255-018-0773-7

Some Existence Theorems on All Fractional (g, f)-factors with Prescribed Properties

Si-zhong Zhou and Tao Zhang
Acta Mathematicae Applicatae Sinica, English Series 34 (2) 344 (2018)
https://doi.org/10.1007/s10255-018-0753-y