Planar graphs without 4-cycles adjacent to triangles are 4-choosable. - Panpan Cheng; Min Chen 012; Yingqian Wang 001 (Discret. Math., 2016)

Locating and identifying codes in dihedral graphs. - Shu Jiao Song; Xingtian Ning; Panpan Cheng (Appl. Math. Comput., 2022)

Disjoint Cycles of Different Lengths in 3-Regular Digraphs. - Zhihong He; Panpan Cheng; Yunshu Gao (Graphs Comb., 2022)

Extremal function of two independent chorded cycles in a bipartite graph. - Panpan Cheng; Yunshu Gao (Appl. Math. Comput., 2025)