Preprints
The size-Ramsey numbers of k-uniform relaxed ℓ-trees
M. Ji, Y. Ma
https://doi.org/10.48550/arXiv.2609.04713
An explicit connected-sum family with unbounded knot Ramsey-stick gap
M. Ji
https://doi.org/10.48550/arXiv.2608.27488
On the structural growth of bipartite Ramsey numbers
M. Ji
https://doi.org/10.48550/arXiv.2604.20668
Asymptotic Bounds for t(3, n) and an Application to t(4, n)
M. Ji, Y. Mao, I. Schiermeyer
https://doi.org/10.48550/arXiv.2502.12596
Gallai-Ramsey number for graph connectivity
Z. Wang, R. Gui, M. Ji and Y. Mao
Ramsey size linear and generalization
E. K. Hng, M. Ji, A. Lamaison
https://doi.org/10.48550/arXiv.2603.25453
Publications
Non-separating trees in k-connected graphs
M. Ji
Discuss. Math. Graph Theory, 46(4) (2026) 949-962
https://doi.org/10.7151/dmgt.2637
A note on a new result related to Chartrand, Kaigars and Lick's theorem
Z. Huang, M. Ji
Graphs and Combinatorics, 42 8 (2026)
https://doi.org/10.1007/s00373-025-03004-6
Bounds for CO-irredundant and irredundant Ramsey numbers
M. Ji, Y. Mao, I. Schiermeyer
Discuss. Math. Graph Theory, 46 (2026) 279–298
https://doi.org/10.7151/dmgt.2604
Non-path results on the connectivity keeping problem
M. Ji
Discuss. Math. Graph Theory, 45(4) (2025) 1163–1184
https://doi.org/10.7151/dmgt.2578
Ramsey and Gallai-Ramsey numbers for forests
Y. Gao, M. Ji, Y. Mao, M. Wei
Discuss. Math. Graph Theory, 45(3) (2025) 971–994
https://doi.org/10.7151/dmgt.2566
Connectivity keeping paths for k-connected bipartite graphs
M. Ji
Discrete Math. Algorithms Appl., 17(01) (2025), 2430003
https://dx.doi.org/10.1142/S1793830924300030
Complete bipartite graphs without small rainbow stars
W. Chen, M. Ji, Y. Mao, M. Wei
Discrete Appl. Math., 340 (2023), 14–20
https://doi.org/10.1016/j.dam.2023.06.038
Extreme graphs on the Sombor indices
C. Yang, M. Ji, K. C. Das, Y. Mao
AIMS Math., 7(10) (2022), 19126–19146
10.3934/math.20221050
Some results on strong conflict-free connection number of graphs
M. Ji, J. Wang
Discrete Math. Algorithms Appl., 13(05) (2021), 2150066
https://doi.org/10.1142/S179383092150066X
Proper disconnection of graphs
X. Bai, Y. Chen, M. Ji, X. Li, Y. Weng and W. Wu
Bull. Malays. Math. Sci. Soc., 44 (2021), 2465–2477
https://doi.org/10.1007/s40840-020-01069-5
Conflict-free connection of trees
H. Chang, M. Ji, X. Li and J. Zhang
J. Comb. Optim., 42 (2021), 340–353
https://doi.org/10.1007/s10878-018-0363-x
Conflict-free connection number and independence number of a graph
J. Wang, M. Ji
Acta Math. Appl. Sin. Engl. Ser., 37 (2021), 278–286
https://doi.org/10.1007/s10255-021-1013-0
(Strong) conflict-free connectivity: Algorithm and complexity
M. Ji, X. Li and X. Zhu
Theoret. Comput. Sci., 804 (2020), 72–80
https://doi.org/10.1016/j.tcs.2019.10.043
Strong conflict-free connection of graphs
M. Ji and X. Li
Appl. Math. Comput., 364 (2020), 124639
https://doi.org/10.1016/j.amc.2019.124639
Erdős–Gallai-type results for conflict-free connection of graphs
M. Ji and X. Li
Ars Comb., 150 (2020)
Almost parallel strong trace model of self-assembly polypeptide nanostructure
J. Wang, G. Hu, M. Ji
MATCH Commun. Math. Comput. Chem., 77 (2017), 783–798
On the existence of F-strong trace of a graph when F induces a forest
J. Wang, X. Jin, M. Ji
MATCH Commun. Math. Comput. Chem., 77 (2017), 799–812
See more publications...
