https://orcid.org/0000-0002-5774-4399
References
- C. Bazgan, A. Harkat-Benhamdine, H. Li, and M. Woźniak, Partitioning vertices of 1-tough graphs into paths, Theor. Comput. Sci. 263 (2001), pp. 255–261.
- P. Chaporkar, K. Kar, X. Luo, and S. Sarkar, Throughput and fairness guarantees through maximal scheduling in wireless networks, IEEE Trans. Inf. Theory 54 (2) (2008), pp. 572–594.
- E. Cheng, Y. Mao, K. Qiu, and Z. Shen, A general approach to deriving diagnosability results of interconnection networks, Int. J. Parallel Emergent Distrib. Syst. 37(4) (2022), pp. 369–397.
- V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973), pp. 215–228.
- G. Dai, Remarks on component factors in graphs, RAIRO-Oper. Res. 56 (2022), pp. 721–730.
- G. Dai, The existence of path-factor covered graphs, Discuss. Math. Graph Theory 37 (2020), pp. 1–12.
- Y. Egawa and M. Furuya, Path-factors involving paths of order seven and nine, Theory Appl. Graphs3 (1) (2015). Available at arXiv:1507.07066
- W. Gao and W.F. Wang, Remarks on component factors, J. Oper. Res. Soc. China 24 (2021), pp. 1–10.
- X. Guan, T. Ma, and C. Shi, Tight toughness, isolated toughness and binding number bounds for the {K2,Cn}-factors, Available at arXiv: 2204.04373, 2022
- A. Gupta, X. Lin, and R. Srikant, Low-complexity distributed scheduling algorithms for wireless networks, IEEE ACM Trans. Netw. 17 (6) (2009), pp. 1846–1859.
- S.S. Liu, L. Lazos, and M. Krunz, Thwarting inside jamming attacks on wireless broadcast communications, in Proceedings of the Fourth ACM Conference on Wireless Network Security, 2011, pp. 29–40.
- T. Ma, E. Cheng, Y. Mao, and X. Wang, A note on maximum fractional matchings of graphs, J. Comb. Optim. 43(1) (2022), pp. 253–264.
- W. Wallis, One-factorizations, Kluwer Academic Publishers, Springer New York, 1997.
- D. Woodall, The binding number of a graph and its Anderson number, J. Comb. Theory Ser. B 15 (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 (2001), pp. 385–390.
- Q. Yu and G. Liu, Graph factors and matching extensions, Higher Education Press, Beijing, 2009, p.xii+353. Springer-Verlag, Berlin.
- L. Zhang and G. Liu, Fractional k-factor of graphs, J. Syst. Sci. Math. Sci. 21 (2001), pp. 88–92.
- S. Zhou, Some results about component factors in graphs, RAIRO-Oper. Res. 53(3) (2019), pp. 723–730.
- S. Zhou and Z. Sun, Binding number conditions for P≥2-factor and P≥3-factor uniform graphs, Discrete Math.343 (3) (2020). 111715.
- S. Zhou, Z. Sun, and H. Liu, Isolated toughness and path-factor uniform graph, RAIRO-Oper. Res.55 (2021), pp. 1279–1290.
- J. Zou, Y. Mao, Z. Wang, and E. Cheng, Fractional matching preclusion number of graphs, Discrete Appl. Math. 311 (2022), pp. 142–153.