Mingxian Zhong
About
Mingxian Zhong is an Assistant Professor of Computer Science at Lehman College, CUNY, and a member of the doctoral faculty at the CUNY Graduate Center, specializing in the theoretical foundations of computer science. Her research is primarily focused on Graph Theory and the design and analysis of algorithms, with a particular interest in structural graph theory and combinatorial optimization. Dr. Zhong explores complex problems related to graph coloring, connectivity, and the characterization of perfect graphs, seeking to develop efficient algorithmic solutions for NP-hard problems. Her work contributes to the fundamental understanding of network structures, providing the mathematical building blocks necessary for optimizing communication networks and computational biology. Through her rigorous analysis of discrete structures, she bridges abstract mathematical proofs with the development of high-performance computing frameworks.
Research Performance Summary
First Recorded Paper
Three-coloring graphs with no induced seven-vertex path I: the triangle-free case
Year: 2014
Citations: 14
Venue: arXiv preprint arXiv:1409.5164
Latest Recorded Paper
3-Coloring-Free Graphs With Only One Prescribed Induced Odd Cycle Length
Year: 2025
Citations: 0
Venue: arXiv preprint arXiv:2512.06367
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.