Qiancheng Ouyang

According to our database, Qiancheng Ouyang authored at least 6 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

New bounds for proper <i>h</i>-conflict-free colourings.

Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang, François Pirot

CoRR, May, 2025

Properly colored cycles in edge-colored complete graphs.

Tianjiao Dai, Hao Li, Yannis Manoussakis, Qiancheng Ouyang

Discret. Math., 2025

2024

On (2,k)-Hamilton-connected graphs.

Tianjiao Dai, Hao Li, Qiancheng Ouyang, Zeng-Xian Tian

Discret. Appl. Math., January, 2024

New Bounds for Odd Colourings of Graphs.

Tianjiao Dai, Qiancheng Ouyang, François Pirot

Electron. J. Comb., 2024

2019

Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10.

Yulin Chang, Qiancheng Ouyang, Guanghui Wang

J. Comb. Optim., 2019

Local antimagic orientations of d-degenerate graphs.

Jie Hu, Qiancheng Ouyang, Guanghui Wang

Discret. Appl. Math., 2019