Some 3-connected 4-edge-critical non-Hamiltonian graphs. - Yuansheng Yang; Chengye Zhao; Xiaohui Lin 002; Yongsong Jiang; Xin Hao (J. Graph Theory, 2005)

Domination dot-critical graphs with no critical vertices. - Chengye Zhao; Yuansheng Yang; Linlin Sun (Discret. Math., 2008)

The Connected and Tree Domination Number of P(n, k) for k = 4, 6, 8. - Chengye Zhao; Yuansheng Yang; Shi Lei; Linlin Sun (Ars Comb., 2009)

The Connected Domination and Tree Domination of P(n, k) for k = 1, 2, [n/2]. - Chengye Zhao; Yuansheng Yang; Linlin Sun; Feilong Cao (Ars Comb., 2011)

The Diameter of Connected Domination Critical Graphs. - Chengye Zhao; Feilong Cao (Ars Comb., 2012)

Hamiltonian Properties of the 3-(γ, 2)-Critical Graphs. - Chengye Zhao; Yuansheng Yang; Linlin Sun (Ars Comb., 2012)

Dominator Colorings of Certain Cartesian Products of Paths and Cycles. - Qin Chen; Chengye Zhao; Min Zhao (Graphs Comb., 2017)

Connected [1, 2]-Sets in Graphs. - Chao Zhang 052; Chengye Zhao (NCTCS, 2018)

Cooperation on the Monte Carlo Rule: Prisoner's Dilemma Game on the Grid. - Jiadong Wu; Chengye Zhao (NCTCS, 2019)

Linear algorithms on Steiner domination of trees. - Chenglin Gao; Chengye Zhao (CoRR, 2019)

Cooperation on the monte carlo rule Prison's dilemma game on the grid. - Jiadong Wu; Chengye Zhao (CoRR, 2019)