Local antimagic orientations of d-degenerate graphs. - Jie Hu; Qiancheng Ouyang; Guanghui Wang 002 (Discret. Appl. Math., 2019)

Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10. - Yulin Chang; Qiancheng Ouyang; Guanghui Wang 002 (J. Comb. Optim., 2019)

New Bounds for Odd Colourings of Graphs. - Tianjiao Dai; Qiancheng Ouyang; François Pirot (Electron. J. Comb., 2024)

On (2,k)-Hamilton-connected graphs. - Tianjiao Dai; Hao Li; Qiancheng Ouyang; Zeng-Xian Tian (Discret. Appl. Math., 2024)

Properly colored cycles in edge-colored complete graphs. - Tianjiao Dai; Hao Li; Yannis Manoussakis; Qiancheng Ouyang (Discret. Math., 2025)

New bounds for proper h-conflict-free colourings. - Quentin Chuet; Tianjiao Dai; Qiancheng Ouyang; François Pirot (CoRR, 2025)