Some sufficient conditions for path-factor uniform graphs

Amahashi, A., Kano, M.: On factors with given components. Discrete Math. 42, 1–6 (1982)

Bazgan, C., Benhamdine, A., Li, H., Woźniak, M.: Partitioning vertices of 1-tough graph into paths. Theor. Comput. Sci. 263, 255–261 (2001)

Enomoto, H., Plummer, M., Saito, A.: Neighborhood unions and factor critical graphs. Discrete Math. 205, 217–220 (1999)

Gao, W., Chen, Y., Wang, Y.: Network vulnerability parameter and results on two surfaces. Int. J. Intell. Syst. 36, 4392–4414 (2021)

Gao, W., Wang, W.: Tight binding number bound for $$P_{\ge 3}$$-factor uniform graphs. Inf. Process. Lett. 172, 106162 (2021)

Hua, H.: Toughness and isolated toughness conditions for $$P_{\ge 3}$$-factor uniform graphs. J. Appl. Math. Comput. 66, 809–821 (2021)

Johansson, R.: An El-Zahár type condition ensuring path-factors. J. Graph Theory 28, 39–42 (1998)

Kaneko, A.: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Comb. Theory Ser. B 88, 195–218 (2003)

Kano, M., Lee, C., Suzuki, K.: Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28(3), 551–556 (2008)

Kano, M., Lu, H., Yu, Q.: Component factors with large components in graphs. Appl. Math. Lett. 23, 385–389 (2010)

Kano, M., Saito, A.: Star-factors with large component. Discrete Math. 312, 2005–2008 (2012)

Liu, H.: Binding number for path-factor uniform graphs. Proc. Romanian Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 23(1), 25–32 (2022)

Wang, S., Zhang, W.: Isolated toughness for path factors in networks. RAIRO Oper. Res. 56(4), 2613–2619 (2022)

Wang, S., Zhang, W.: On $$k$$-orthogonal factorizations in networks. RAIRO Oper. Res. 55(2), 969–977 (2021)

Wang, S., Zhang, W.: Research on fractional critical covered graphs. Probl. Inf. Transm. 56, 270–277 (2020)

Yuan, Y., Hao, R.: Independence number, connectivity and all fractional $$(a, b, k)$$-critical graphs. Discuss. Math. Graph Theory 39, 183–190 (2019)

Zhang, H., Zhou, S.: Characterizations for $$P_{\ge 2}$$-factor and $$P_{\ge 3}$$-factor covered graphs. Discrete Math. 309, 2067–2076 (2009)

Zhou, S.: A neighborhood union condition for fractional $$(a, b, k)$$-critical covered graphs. Discrete Appl. Math. 323, 343–348 (2022)

Zhou, S.: A result on fractional $$(a,b,k)$$-critical covered graphs. Acta Math. Appl. Sin. Engl. Ser. 37(4), 657–664 (2021)

Zhou, S.: Path factors and neighborhoods of independent sets in graphs. Acta Math. Appl. Sin. Engl. Ser. (2022). https://doi.org/10.1007/s10255-022-1096-2

Zhou, S.: Remarks on restricted fractional $$(g, f)$$-factors in graphs. Discrete Appl. Math. (2022). https://doi.org/10.1016/j.dam.2022.07.020

Zhou, S., Bian, Q., Pan, Q.: Path factors in subgraphs. Discrete Appl. Math. 319, 183–191 (2022)

Zhou, S., Liu, H.: Discussions on orthogonal factorizations in digraphs. Acta Math. Appl. Sin. Engl. Ser. 38(2), 417–425 (2022)

Zhou, S., Liu, H.: Two sufficient conditions for odd $$[1, b]$$-factors in graphs. Linear Algebra Appl. 661, 149–162 (2023)

Zhou, S., Liu, H., Xu, Y.: A note on fractional ID-$$[a, b]$$-factor-critical covered graphs. Discrete Appl. Math. 319, 511–516 (2022)

Zhou, S., Sun, Z.: A neighborhood condition for graphs to have restricted fractional $$(g, f)$$-factors. Contrib. Discrete Math. 16(1), 138–149 (2021)

Zhou, S., Sun, Z.: Binding number conditions for $$P_{\ge 2}$$-factor and $$P_{\ge 3}$$-factor uniform graphs. Discrete Math. 343(3), 111715 (2020)

Zhou, S., Wu, J., Bian, Q.: On path-factor critical deleted (or covered) graphs. Aequ. Math. 96(4), 795–802 (2022)

Zhou, S., Wu, J., Liu, H.: Independence number and connectivity for fractional $$(a, b, k)$$-critical covered graphs. RAIRO Oper. Res. 56(4), 2535–2542 (2022)

Zhou, S., Wu, J., Xu, Y.: Toughness, isolated toughness and path factors in graphs. Bull. Aust. Math. Soc. 106(2), 195–202 (2022)