Welcome to Rongxing Xu's Home Page

Xu (徐), Rongxing (荣兴)

I am an associate professor in the School of Mathematical Sciences at Zhejiang Normal University. I was a postdoctoral fellow at University of Science and Technology of China (during 07/2021-06/2023) under the supervision of Prof. Jie Ma. I obtained my Ph.D. degree in 2021 from Zhejiang Normal University under the supervision of Prof. Xuding Zhu. During the Ph.D. studying peorid, I receieved CSC Scholarships in 2018, which supported me to visit University of Paris 7 and worked with Prof. Reza Naserasr for 24 months (10/2018 - 09/2020). I got my M.S. degree from Zhejiang Normal University in 2017 under the supervision of Prof. Xinzhong Lv, Prof. Guixian Tian and Prof. Xuding Zhu. Back in 2014, I got my B.S. degree from Henan University.

Email: xurongxing (at) zjnu.edu.cn

Research Interests:

Graph Theory; Discrete Mathematics...

Curriculum Vitae: CV

Publications:

  1. List colouring of graphs and generalized Dyck paths. Rongxing Xu, Yeong-nan Yeh and Xuding Zhu, Discrete Mathematics, 341 (2018) 810–819.
  2. Bounded Greedy Nim. Rongxing Xu and Xuding Zhu. Theoretical Computer Science, 746 (2018) 1–5.
  3. Greedy Nim_{\rm k} Game. Xinzhong Lv, Rongxing Xu and Xuding Zhu, Journal of Combinatorial Optimization, 35, 1241–1249 (2018).
  4. Multiple list coloring of 3-choice critical graphs. Rongxing Xu and Xuding Zhu, Journal of Graph Theory, 95, 4, 638– 654 (2020).
  5. The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs. Rongxing Xu and Xuding Zhu, SIAM Journal on Discrete Math. Vol. 36, No. 4, pp. 2585-2601 (2022).
  6. The strong fractional choice number of 3‐choice‐critical graphs. Rongxing Xu and Xuding Zhu, Journal of Graph Theory, 102, 2, 346-373 (2023).
  7. Mapping sparse signed graphs to (K_{2k},M). Reza Naserasr, Riste Skrekovski, Zhouningxin Wang and Rongxing Xu, Journal of Graph Theory, 104, 3, 611– 644 (2023).
  8. Extended Double Covers and Homomorphism Bounds of Signed Graphs. Florent Foucaud, Reza Naserasr and Rongxing Xu, The Electronic Journal of Combinatorics, 30 (3) (2023) # P3.31.
  9. On Two problems of defective choosability. Jie Ma, Rongxing Xu and Xuding Zhu, Journal of Graph Theory, 108, 2, 313– 324 (2024).
  10. Decomposition of triangle-free planar graphs. Rongxing Xu and Xuding Zhu, European Journal of Combinatorics, 130 (2025), Paper No. 104227, 18 pp.
  11. Proper conflict-free degree-choosability of outerplanar graphs . Masaki Kashima , Riste Skrekovski and Rongxing Xu, Discrete Math. 349 (2026), no. 3, Paper No. 114800.
  12. Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy. Masaki Kashima , Riste Skrekovski and Rongxing Xu, Discrete Math. 349 (2026), no. 6, Paper No. 115003.
  13. Results on proper conflict-free list coloring of graphs. Masaki Kashima , Riste Skrekovski and Rongxing Xu, Submitted.
  14. Proof of a conjecture of Voss on bridges of longest cycles. Jie Ma and Rongxing Xu, submitted, 2025.
  15. Partitioning triangle-free planar graphs into a forest and a linear forest. Guanwu Liu and Rongxing Xu, submitted, 2025.
  16. Degree-choosability of proper conflict-free list coloring of sparse graphs . Masaki Kashima , Riste Skrekovski and Rongxing Xu, Submitted.
  17. The strong fractional choice number of triangle-free planar graphs . Xiaolan Hu and Rongxing Xu, submitted, 2026.

Useful Links:

👁️‍🗨️