On characterization of uniquely 3-list colorable complete multipartite graphs. - Erfang Shan; Yancai Zhao (Discuss. Math. Graph Theory, 2010)

The algorithmic complexity of mixed domination in graphs. - Yancai Zhao; Liying Kang; Moo Young Sohn (Theor. Comput. Sci., 2011)

Signed total domination on Kronecker products of two complete graphs. - Yancai Zhao; Erfang Shan; Hossein Abdollahzadeh Ahangar (Australas. J Comb., 2013)

Acyclic vertex coloring of graphs of maximum degree six. - Yancai Zhao; Lianying Miao; Shiyou Pang; Wenyao Song (Discret. Math., 2014)

Maximal matching and edge domination in complete multipartite graphs. - Wenyao Song; Lianying Miao; Haichao Wang 004; Yancai Zhao (Int. J. Comput. Math., 2014)

Signed Roman domination in graphs. - Hossein Abdollahzadeh Ahangar; Michael A. Henning; Christian Löwenstein; Yancai Zhao; Vladimir Samodivkin (J. Comb. Optim., 2014)

On the algorithmic complexity of edge total domination. - Yancai Zhao; Zuhua Liao; Lianying Miao (Theor. Comput. Sci., 2014)

Upper signed k-domination number in graphs. - Ligang Zhou; Erfang Shan; Yancai Zhao (Ars Comb., 2015)

Signed mixed dominating functions in complete bipartite graphs. - Erfang Shan; Yancai Zhao (Int. J. Comput. Math., 2015)

3-Factor-Criticality in Double Domination Edge Critical Graphs. - Haichao Wang 004; Erfang Shan; Yancai Zhao (Graphs Comb., 2016)

Signed Roman edge domination numbers in graphs. - Hossein Abdollahzadeh Ahangar; Jafar Amjadi; Seyed Mahmoud Sheikholeslami; Lutz Volkmann; Yancai Zhao (J. Comb. Optim., 2016)

An efficient algorithm for distance total domination in block graphs. - Yancai Zhao; Erfang Shan (J. Comb. Optim., 2016)

The complexity od secure domination problem in graphs. - Yun-Ping Deng; Haichao Wang 004; Yancai Zhao (Discuss. Math. Graph Theory, 2018)

Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4. - Zuosong Liang; Yanxia Dong; Yancai Zhao; Huiyu Xing (Graphs Comb., 2021)