1. Innovative Instructional Design Based on AI- Augmented Distributed Learning Technologies for Cost-Effective Data Science Courses, submitted (2024).
2. Xiaoxia Lin, Keke Wang, Meng Zhang, and Hong-Jian Lai, Bounding l-edge-connectivity in edge-connectivity, Discrete Applied Mathematics, 321 (2022) 350 - 356.
3. Rensen Ma, Aimei Yu, Keke Wang and Hong-Jian Lai, Multigraphic Degree Sequences and Hamiltonian - Connected Line Graphs, Acta Mathematicae Applicatae Sinica, English Series Vol. 37, No. 4 (2021) 800 - 806.
4. Hong-Jian Lai, Keke Wang, Xiaowei Xie, and Mingquan Zhan, Catlin's reduced graphs with small orders, AKCE International Journal of Graphs and Combinatorics, 17(2020) 679 - 690.
5. Keke Wang, Mingquan Zhan, and Hong-Jian Lai, A Discharging Method to Find Subgraphs Having Two Edge-disjoint Spanning Trees, Ars Combinatoria 144(2019), pp, 187 - 193.
6. Ping Li, Keke Wang, Mingquan Zhan, and Hong-Jian Lai, Strongly spanning trailable graphs with short longest Paths, Ars Combinatoria 137(2018), 3 - 39.
7. Jianping Liu, Aimei Yu, Keke Wang and Hong-Jian Lai, Degree sum and Hamiltonian-Connected Line Graphs, Discrete Math, 341(2018), 1363 - 3179.
8. Aimei Yu, Rensen Ma, Keke Wang, and Jiangxu Kong, Strongly spanning triable graphs in graph family C2(4, k), Chinese Journal of Contemporary Mathematics, 39(2018), 53-62.
9. Jinquan Xu, Ping Li, Zhengke Miao, Keke Wang and Hong-Jian Lai, Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs, International Journal of Computer Mathematics, 91(2014), 1662-1672.
10. H. Chuang, H.-J. Lai, G. R. Omidi, K. Wang and N. Zakeri, On group choosability of graphs, II, Graphs and Combinatorics, 30 (2014), 549-563.
11. Wei Xiong, Hong-Jian Lai, Xiaoling Ma, Keke Wang and Meng Zhang, Hamiltonian cycles in 3-connected claw-free and net-free graphs, Discrete Math, 313 (2013), 784 - 7951.
12. Keke Wang, Rongxia Hao, and Jianbing Liu, Group connectivity of 1-edge deletable IM-extendable graphs, International Journal of Mathematical Combinatorics 1 (2011), 113-118.