人才荟萃
|
||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||
发布时间:2021-11-24浏览次数:19次 |
||||||||||||||||||||||||||||||
1.Zhao X, Chen S.A note on tight cuts in matching-covered graphs[J].Discrete Mathematics and Theoretical Computer Science, (23) 1: #16, 2021. 2 Zhao X, Dong F M, Chen S. On non-feasible edge sets in matching-covered graphs [J].Journal of Graph Theory, (95) 2: 192-208, 2020 3. Zhao X, Chen S. Proper 2-coloring game on some trees [J]. Theoretical Computer Science. 778: 1-18, 2019. 4. Zhao X, Liu W A, One-pile misère bounded Nim with two alliances [J]. Discrete Applied Mathematics,214:16-23, 2016. 5.Liu W A, Zhao X, Nim with one or two dynamic restrictions [J]. Discrete Applied Mathematics, 198:48-64, 2016. 6.Liu W A, Zhao X, Extensions of Small Nim [J]. 7th International Joint Conference on Computational Sciences, 2014: 237-241(EI收录). 7.Liu W A, Zhao X, Adjoining to (s,t)-Wythoff's game its P-positions as moves [J]. Discrete Applied Mathematics, 179:28-43, 2014. |
||||||||||||||||||||||||||||||