References
- Aldred, R., Fujisawa, J, Saito, A. (2019). Pairs and triples of forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 90(1): 61–82.
- Cai, J., Wang, X, Yan, G. (2014). A note on the existence of fractional f-factors in random graphs. Acta Math. Appl. Sin. Engl. Ser. 30(3): 677–680.
- Egawa, Y, Kano, M. (1996). Sufficient conditions for graphs to have (g, f)-factors. Discrete Math. 151(1–3): 87–90.
- Ferrara, M. J., Gould, R. J, Hartke, S. G. (2007). The structure and existence of 2-factors in iterated line graphs. Discuss. Math. Graph Theory 27(3): 507–526.
- Jiang, J. (2020). A sufficient condition for fractional ID-[a,b]-factor-critical covered graphs. Util. Math. 114: 173–179.
- Kano, M., Lee, C, Suzuki, K. (2008). Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28(3): 551–556.
- Katerinis, P. (2019). Fractional l-factors in regular graphs. Aust. J. Combin. 73(3): 432–439.
- Li, Z., Yan, G, Zhang, X. (2002). On fractional (g, f)-covered graphs. OR Trans. (China.) 6(4): 65–68.
- Liu, G, Zhang, L. (2008). Toughness and the existence of fractional k-factors of graphs. Discrete Math. 308(9): 1741–1748.
- Lv, X. (2020). A degree condition for fractional (g, f, n)-critical covered graphs. AIMS Mathematics 5(2): 872–878.
- Matsuda, H. (2000). A neighborhood condition for graphs to have [a,b]-factors. Discrete Math. 224: 289–292.
- Shiu, W. C, Liu, G. Z. (2008). G. Liu, k-factors in regular graphs. Acta Math. Sin-English. Ser. 24(7): 1213–1220.
- Wang, S, Zhang, W. (2021). On k-orthogonal factorizations in networks. RAIRO-Oper. Res. 55(2): 969–977.
- Wang, S, Zhang, W. (2020). Research on fractional critical covered graphs. Probl. Inf. Transm. 56(3): 270–277.
- Wang, S, Zhang, W. (2021). Toughness for fractional (2,b,k)-critical covered graphs. J. Oper. Res. Soc. China. DOI: https://doi.org/10.1007/s40305-021-00359-4
- Yuan, Y, Hao, R. (2019). A degree condition for fractional [a,b]-covered graphs. Inf. Process. Lett. 143: 20–23.
- Yuan, Y, Hao, R. (2018). A neighborhood union condition for fractional ID-[a,b]-factor-critical graphs. Acta Math. Appl. Sin.-English Ser. 34(4): 775–781.
- Yuan, Y, Hao, R. (2019). Independence number, connectivity and all fractional (a, b, k)-critical graphs. Discuss. Math. Graph Theory 39: 183–190.
- Zhou, S. (2021). A neighborhood union condition for fractional (a, b, k)-critical covered graphs. Discrete Appl. Math. DOI: https://doi.org/10.1016/j.dam.2021.05.022
- Zhou, S. (2021). A result on fractional (a, b, k)-critical covered graphs. Acta Math. Appl. Sin. Engl. Ser. 37(4): 657–664.
- Zhou, S. (2021). Binding numbers and restricted fractional (g, f)-factors in graphs. Discrete Appl. Math. 305: 350–356.
- Zhou, S. (2020). Remarks on path factors in graphs. RAIRO-Oper. Res. 54(6): 1827–1834.
- Zhou, S., Bian, Q, Pan, Q. (2021). Path factors in subgraphs. Discrete Appl. Math. DOI: https://doi.org/10.1016/j.dam.2021.04.012
- Zhou, S., Sun, Z, Liu, H. (2021). On P≥3-factor deleted graphs. Acta Math. Appl. Sin. Engl. Ser. DOI: https://doi.org/10.1007/s10255-022-1053-0
- Zhou, S., Sun, Z, Liu, H. (2021). Isolated toughness and path-factor uniform graphs. RAIRO-Oper. Res. 55(3): 1279–1290.
- Zhou, S., Sun, Z, Pan, Q. (2020). A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs. Probl. Inf. Transm. 56(4): 332–344.
- Zhou, S., Xu, Y, Sun, Z. (2019). Degree conditions for fractional (a, b, k)-critical covered graphs. Inf. Process. Lett. 152: 105838.
- Zhou, S., Xu, L, Xu, Z. (2019). Remarks on fractional ID-k-factor-critical graphs. Acta Math. Appl. Sin. Engl. Ser. 35(2): 458–464.
- Zhou, S., Zhang, T, Xu, Z. (2020). Subgraphs with orthogonal factorizations in graphs. Discrete Appl. Math. 286: 29–34.