An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. - Lianying Miao; Shiyou Pang; Jianliang Wu 001 (Discret. Math., 2003)

On the size of edge-coloring critical graphs with maximum degree 4. - Lianying Miao; Shiyou Pang (Discret. Math., 2008)

The Clique Minor of Graphs with Independence Number Two. - Shiyou Pang; Lianying Miao; Qingbo Sun; Zhengke Miao (Discret. Math. Algorithms Appl., 2009)

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

On the independence number of edge chromatic critical graphs. - Lianying Miao; Zhengke Miao; Shiyou Pang; Wenyao Song (Discuss. Math. Graph Theory, 2014)

On the size of critical graphs with small maximum degree. - Lianying Miao; Wenyao Song; Shiyou Pang; Zhengke Miao (Int. J. Comput. Math., 2014)

On the extremal values of the eccentric distance sum of trees. - Lianying Miao; Qianqiu Cao; Na Cui; Shiyou Pang (Discret. Appl. Math., 2015)

On the extremal values of the eccentric distance sum of trees with a given domination number. - Lianying Miao; Shiyou Pang; Fang Liu; Eryan Wang; Xiaoqing Guo (Discret. Appl. Math., 2017)