Path-factor critical covered graphs and path-factor uniform graphs
RAIRO-Oper. Res., 56 6 (2022) 4317-4325
Published online: 2022-12-21
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):
Spectral radius and k-factor-critical graphs
Sizhong Zhou, Zhiren Sun and Yuli ZhangThe Journal of Supercomputing 81 (3) (2025)
https://doi.org/10.1007/s11227-024-06902-3
An odd [1, b]-factor in a graph from signless Laplacian spectral radius
Sizhong Zhou and Quanru PanRAIRO - Operations Research 59 (1) 33 (2025)
https://doi.org/10.1051/ro/2024223
Star-factors with large components, fractional k-extendability and spectral radius in graphs
Sizhong Zhou and Hongxia LiuDiscrete Applied Mathematics 361 402 (2025)
https://doi.org/10.1016/j.dam.2024.10.018
Characterizing path-factor deleted graphs via Q-index and D-index
Xiaoyun Lv, Jianxi Li and Shou-Jun XuRAIRO - Operations Research 59 (2) 1121 (2025)
https://doi.org/10.1051/ro/2025029
A new result on orthogonal factorizations in networks
Sizhong Zhou, Quanru Pan and Yang XuFilomat 38 (20) 7235 (2024)
https://doi.org/10.2298/FIL2420235Z
The A-spectral radius for path-factors in graphs
Sizhong Zhou, Yuli Zhang and Zhiren SunDiscrete Mathematics 347 (5) 113940 (2024)
https://doi.org/10.1016/j.disc.2024.113940
Degree conditions for path-factors in graphs
Ping ZhangRAIRO - Operations Research 58 (5) 4521 (2024)
https://doi.org/10.1051/ro/2024184
Spanning k-trees and distance signless Laplacian spectral radius of graphs
Sizhong Zhou, Yuli Zhang and Hongxia LiuDiscrete Applied Mathematics 358 358 (2024)
https://doi.org/10.1016/j.dam.2024.07.010
On perfect 2-matching uniform graphs
Hongxia LIU and Xiaogang PANProceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science 25 (2) 95 (2024)
https://doi.org/10.59277/PRA-SER.A.25.2.02
Characterizing spanning trees via the size or the spectral radius of graphs
Jie WuAequationes mathematicae 98 (6) 1441 (2024)
https://doi.org/10.1007/s00010-024-01112-x
Tight toughness bounds for path-factor critical avoidable graphs
Wenqi Wang and Guowei DaiAKCE International Journal of Graphs and Combinatorics 21 (2) 167 (2024)
https://doi.org/10.1080/09728600.2024.2314512
Independence number and minimum degree for path-factor critical uniform graphs
Hongxia Liu and Xiaogang PanDiscrete Applied Mathematics 359 153 (2024)
https://doi.org/10.1016/j.dam.2024.07.043
A spectral condition for component factors in graphs
Sufang Wang and Wei ZhangRAIRO - Operations Research 58 (4) 3233 (2024)
https://doi.org/10.1051/ro/2024126
On path-factor critical uniform graphs
Hongxia LiuIndian Journal of Pure and Applied Mathematics 55 (4) 1222 (2024)
https://doi.org/10.1007/s13226-023-00428-9
A sufficient condition for the existence of fractional (g,f,n)-critical covered graphs
Jie WuFilomat 38 (6) 2177 (2024)
https://doi.org/10.2298/FIL2406177W
Some results on star-factor deleted graphs
Sufang Wang and Wei ZhangFilomat 38 (3) 1101 (2024)
https://doi.org/10.2298/FIL2403101W
Sufficient conditions for fractional [a, b]-deleted graphs
Sizhong Zhou and Yuli ZhangIndian Journal of Pure and Applied Mathematics (2024)
https://doi.org/10.1007/s13226-024-00564-w
Some existence theorems on path-factor critical avoidable graphs
Sizhong Zhou and Hongxia LiuRAIRO - Operations Research 58 (2) 2015 (2024)
https://doi.org/10.1051/ro/2024071
Distance signless Laplacian spectral radius for the existence of path-factors in graphs
Sizhong Zhou, Zhiren Sun and Hongxia LiuAequationes mathematicae 98 (3) 727 (2024)
https://doi.org/10.1007/s00010-024-01075-z
Spanning k-trees and distance spectral radius in graphs
Sizhong Zhou and Jiancheng WuThe Journal of Supercomputing 80 (16) 23357 (2024)
https://doi.org/10.1007/s11227-024-06355-8
Toughness and isolated toughness conditions for path-factor critical covered graphs
Guowei DaiRAIRO - Operations Research 57 (2) 847 (2023)
https://doi.org/10.1051/ro/2023039
Sufficient conditions for graphs to have strong parity factors
Sizhong Zhou and Yuli ZhangRAIRO - Operations Research 57 (5) 2465 (2023)
https://doi.org/10.1051/ro/2023147
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
Sizhong Zhou and Hongxia LiuRAIRO - Operations Research 57 (3) 1343 (2023)
https://doi.org/10.1051/ro/2023069
Degree conditions for the existence of a {P2, P5}-factor in a graph
Sufang Wang and Wei ZhangRAIRO - Operations Research 57 (4) 2231 (2023)
https://doi.org/10.1051/ro/2023111
Degree conditions for path-factor critical deleted or covered graphs
Hongxia LiuRAIRO - Operations Research 57 (3) 1443 (2023)
https://doi.org/10.1051/ro/2023078
Isolated toughness for fractional (2;b;k)-critical covered graphs
Sizhong ZHOU, Quanru PAN and Lan XUProceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science 24 (1) 11 (2023)
https://doi.org/10.59277/PRA-SER.A.24.1.02