发表论文
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
Complete bipartite graphs without small rainbow stars
W. Chen, M. Ji, Y. Mao, M. Wei
Discrete Appl. Math., 340 (2023), 14-20
Extreme graphs on the Sombor indices
C. Yang, M. Ji, K. C. Das, Y. Mao
AIMS Math., 7(10)(2022), 19126-19146
Some results on strong conflict-free connection number of graphs
M. Ji, J. Wang
Discrete Math. Algorithms Appl. 13(05), 2021, 2150066
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
Conflict-free connection of trees
H. Chang, M. Ji, X. Li and J. Zhang
J. Comb. Optim., 42 (2021), 340-353
Conflict-free connection number and independence number of a graph
J. Wang, M. Ji
Acta Math. Appl. Sin. Engl. Ser., 37 (2021), 278-286
(Strong) conflict-free connectivity: Algorithm an complexity
M. Ji, X. Li and X. Zhu
Theoret. Comput. Sci., 804 (2020), 72-80
Strong conflict-free connection of graphs
M. Ji and X. Li
Appl. Math. Comput., 364 (2020), 124639
Erd˝os-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
查看更多论文...
投稿论文与备投论文
A note on multicolor bipartite Ramsey numbers
M. Ji
A lower bound for multicolour bipartite Ramsey numbers
M. Ji
Asymptotics of t(3,n) and s(3,n)
M. Ji, Y. Mao, I. Schiermeyer
Connectivity keeping star-paths for $k$-connected graphs
M. Ji
Gallai-Ramsey number for graph connectivity
Z. Wang, R. Gui, M. Ji and Y. Mao
Upper bounds for some Ramsey numbers
E. K. Hng, M. Ji, A. Lamaison
