Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable. - Yingqian Wang 001; Ming Chen 015; Liang Shen (Discret. Math., 2008)

A note on 3-choosability of planar graphs. - Yingqian Wang 001; Huajing Lu; Ming Chen 015 (Inf. Process. Lett., 2008)

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. - Yingqian Wang 001; Huajing Lu; Ming Chen 015 (Discret. Math., 2010)

Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable. - Ming Chen 015; Yingqian Wang 001; Peipei Liu; Jinghan Xu (Discret. Math., 2016)

Gallai-Ramsey Numbers of Odd Cycles and Complete Bipartite Graphs. - Ming Chen 015; Yusheng Li 001; Chaoping Pei (Graphs Comb., 2018)

Ramsey Good Graphs with Long Suspended Paths. - Chaoping Pei; Ming Chen 015; Yusheng Li 001; Pei Yu (Graphs Comb., 2018)

Independence and matching number of some graphs. - Ming Chen 015; Yusheng Li 001; Yiting Yang (J. Comb. Optim., 2019)

Linear list coloring of some sparse graph. - Ming Chen 015; Yusheng Li 001; Li Zhang 037 (Discuss. Math. Graph Theory, 2021)