References
- V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5(3) (1973), pp. 215–228.
- W. Gao and W.F. Wang, Remarks on component factors, J. Oper. Res. Soc. China 11 (2021), pp. 1–10.
- X. Guan, T. Ma, and C. Shi, Tight toughness, isolated toughness and binding number bounds for the {K2,Cn}-factors, (2022), arXiv:2204.04373.
- M. Kano, H. Lu, and Q. Yu, Fractional factors, component factors and isolated vertex conditions in graphs, Electron. J. Combin. 26(4) (2019), pp. #P4.331.
- G. Liu and L. Zhang, Toughness and the existence of fractional k-factors of graphs, Discrete Math. 308(9) (2008), pp. 1741–1748.
- M.D. Plummer, Graph factors and factorization: 1985–2003: A survey, Discrete Math. 307(7–8) (2007), pp. 791–821.
- E.R. Scheinerman and D.H. Ullman, Fractional Graph Theory: A Rational Approach to the Theory of Graphs, Courier Corporation, 2011.
- D.R. Woodall, The binding number of a graph and its Anderson number, J. Combin. Theory Ser. B. 15(3) (1973), pp. 225–255.
- J. Yang, Y. Ma, and G. Liu, Fractional (g,f)-factors in graphs, Appl. Math. J. Chinese Univ. Ser. A 16(4) (2001), pp. 385–390.
- L. Zhang and G. Liu, Fractional k-factor of graphs, J. Syst. Sci. Math. Sci. 21 (2001), pp. 88–92.
- S. Zhou, Q. Bian, and Q. Pan, Path factors in subgraphs, Discrete Appl. Math. 319 (2022), pp. 183–191.