代表论文: [1] H. Liu, Degree conditions for path-factor critical deleted or covered graphs, RAIRO-Oper. Res. 57 (2023) 1443 – 1451. (SCI) [2] H. Liu, On path-factor critical uniform graphs, Indian J. Pure Appl. Math.(2023)DOI:10.1007/s13226-023-00428-9 (SCI) [3] H. Liu, Binding number for path-factor uniform graphs, Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 23(1) (2022) 25–32. (SCI) [4] H. Liu, Sharp conditions on fractional ID-(g, f)-factor-critical covered graphs, RAIRO-Oper. Res. 56 (2022) 3257 – 3265. (SCI) [5] H. Liu, Sun toughness and path-factor uniform graphs, RAIRO-Oper. Res. 56 (2022) 4057–4062. ( SCI) [6] S. Zhou, H. Liu, Two sufficient conditions for odd [1, b]-factors in graphs, Linear Algebra and its Applications, 661 (2023) 149–162. ( SCI三区, 高被引) [7] S. Zhou, H. Liu, Discussions on orthogonal factorizations in digraphs, Acta Math. Appl. Sin. Engl. Ser. 38(2) (2022) 417–425. (SCI三区, 高被引) [8] S. Zhou, Z. Sun, H. Liu, On P ≥3-factor deleted graphs. Acta Math. Appl. Sin. Engl. Ser. 38(2022) 178–186. (SCI三区,高被引) [9] S. Zhou, H. Liu, Y. Xu, A note on fractional ID-[a,b]-factor-critical covered graphs. Discrete Appl. Math. 319 (2022) 511–516. (SCI三区,高被引). [10] S. Zhou, Z. Sun, H. Liu, Some sufficient conditions for path-factor uniform graphs. Aequationes Math. 97(2023) 489–500. (SCI三区,高被引) [11] S. Zhou, J. Wu, H. Liu, Independence number and connectivity for fractional (a, b, k)-critical covered graphs, RAIRO-Oper. Res. 56 (2022) 2535–2542. (SCI) [12] Liu Hongxia, Liu Guizhen, Neighbor set for the existence of (g,f,n)-critical graphs, Bulletin of the Malaysian Mathematical Sciences Society, (2) 34(1) (2011), 39–49. (SCI) [13] Liu Hongxia, Liu Guizhen, On fractional (g,f,n)-critical graphs, Ars Combinatoria, 97(2010), 183-191. (SCI) [14] Liu Hongxia, Liu Guizhen, A neighborhood condition for graphs to have (g,f)-factors, Ars Combinatoria, 93 (2009), 257-264. (SCI) [15] Liu Hongxia, Liu Guizhen, Binding number and minimum degree for the existence of ( g,f,n)-critical graphs, J. Appl. Math. Comput., 29(2009), 207-216. (EI) [16] Liu Hongxia, Liu Guizhen, "Binding number, minimum degree for connected (g,f+1)-factors in graphs", Journal of Combinatorial Mathematics and Combinatorial Computing , Vol 87, November, 2013, 87-99.(EI) [17] S. Zhou, H. Liu, T. Zhang, Randomly orthogonal factorizations with constraints in bipartite Networks, Chaos, Solitons and Fractals, 112 (2018) 31–35. (SCI三区) [18] S. Zhou, Z. Sun, H. Liu, Sun toughness and P ≥3-factors in graphs, Contributions to Discrete Mathematics, 14 (1) ( 2019)167–174. (SCI) [19] S. Zhou, H. Liu, Y. Xu, Binding numbers for fractional (a,b,k)-critical covered graphs, Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science, 21(2) (2020) 115 – 121. (SCI) [20] S. Zhou, H. Liu, Z. Sun, All fractional [a,b]-factors with prescribed properties, Ars Combinatoria, 149(2020) 309 – 318. (SCI) |