Jing Wang and Meng Ji. Conflict-free connection number and independence number of a graph, “Under Review”.
Xuqing Bai, You Chen, Meng Ji, Xueliang Li, Yindi Weng and Wenyan Wu. Proper disconnection of graphs, Bulletin of the Malaysian Mathematical Sciences Society, “Accepted”.
Meng Ji and Jing Wang. On strong conflict-free connection of graphs, “Under Review”
Meng Ji, Xueliang Li and Ingo Schiermeyer, The upper bounds and the extreme result for conict-free vertex-connection number,“Submitted”.
Meng Ji and Xueliang Li. Strong conflict-free connection of graphs, Applied Mathematics and Computation, Volume 364, 2020, 124639.
Meng Ji and Xueliang Li. Erd\"{o}s-Gallai-type results for conflict-free connection of graphs, Ars Combinatoria, Volume 150, April 2020.
Meng Ji, Xueliang Li and Xiaoyu Zhu. (Strong) conflict-free connectivity: Algorithm and complexity, Theoretical Computer Science, Volume 804 (2020) 72-80.
Hong Chang, Meng Ji, Xueliang Li and Jingshu Zhang. Conflict-free connection of trees, Journal of Combinatorial Optimization 2018
Jing Wang, Guang Hu and Meng Ji. Almost parallel strong trace model of self-assembly polypeptide nanostructure, MATCH Commun. Math. Comput. Chem. 77 (2017) 783-798.
Jing Wang, Xianan Jin and Meng Ji. On the existence of F-strong trace of a graph when F induces a forest, MATCH Commun. Math. Comput. Chem. Volume 77 (2017) 799-812.