Edge-coloring critical graphs with high degree. - Lianying Miao; Jianliang Wu 001 (Discret. Math., 2002)

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)

The Dynamic Coloring Numbers of Pseudo-Halin Graphs. - Xianyong Meng; Lianying Miao; Bentang Su; Rensuo Li (Ars Comb., 2006)

On 3-choosability of plane graphs without 3-, 8- and 9-cycles. - Xiaoying Zhu; Lianying Miao; Cuiqi Wang (Australas. J Comb., 2007)

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)

Every line graph of a 4-edge-connected graph is I-connected. - Hong-Jian Lai; Lianying Miao; Yehong Shao (Eur. J. Comb., 2009)

The size of edge chromatic critical graphs with maximum degree 6. - Rong Luo; Lianying Miao; Yue Zhao 008 (J. Graph Theory, 2009)

On the size of critical graphs with maximum degree 8. - Lianying Miao; Qingbo Sun (Discret. Math., 2010)

The Δ2-conjecture for L(2, 1)-labelings is true for total graphs. - Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang (Appl. Math. Lett., 2011)

On the Independence Number of Edge Chromatic Critical Graphs. - Lianying Miao (Ars Comb., 2011)

On the average degree of critical graphs with maximum degree six. - Lianying Miao; Jibin Qu; Qingbo Sun (Discret. Math., 2011)

New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs. - Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang (Theor. Comput. Sci., 2011)

L(p, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees. - Ziming Duan; Lianying Miao; Cuiqi Wang; Zhengke Miao (Discret. Math., 2013)

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)

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

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

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

Element deletion changes in dynamic coloring of graphs. - Lianying Miao; Hong-Jian Lai; Yan-Fang Guo; Zhengke Miao (Discret. Math., 2016)

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)

Strong edge-coloring of planar graphs. - Lianying Miao; Wenyao Song (Discuss. Math. Graph Theory, 2017)

On list r-hued coloring of planar graphs. - Haiyang Zhu; Sheng Chen; Lianying Miao; Xinzhong Lv (J. Comb. Optim., 2017)

Synchronization of time-delayed systems with discontinuous coupling. - Hong-jun Shi; Lianying Miao; Yong-zheng Sun (Kybernetika, 2017)

Neighbor sum distinguishing total coloring of sparse IC-planar graphs. - Wenyao Song; Lianying Miao; Jinbo Li; Yueying Zhao; Jingru Pang (Discret. Appl. Math., 2018)

The list L(2, 1)-labeling of planar graphs. - Haiyang Zhu; Lianying Miao; Sheng Chen; Xinzhong Lü; Wenyao Song (Discret. Math., 2018)

Sensitivity of r-hued colouring of graphs. - Huimin Song; Lianying Miao; Zhengke Miao; Hong-Jian Lai (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

Acyclic coloring of graphs with maximum degree at most six. - Juan Wang; Lianying Miao (Discret. Math., 2019)

The List L(2, 1)-Labeling of Planar Graphs with Large Girth. - Haiyang Zhu; Junlei Zhu; Ying Liu; Shuling Wang; Danjun Huang; Lianying Miao (AAIM, 2020)

On the extremal values of the eccentric distance sum of trees with a given maximum degree. - Lianying Miao; Jingru Pang; Shoujun Xu (Discret. Appl. Math., 2020)

Neighbor sum distinguishing total coloring of IC-planar graphs. - Wenyao Song; Yuanyuan Duan; Lianying Miao (Discret. Math., 2020)

Acyclic L-coloring of graphs with maximum degrees 5 and 6. - Juan Wang; Lianying Miao; Wenyao Song (Discret. Math., 2020)

Neighbor sum distinguishing total choosability of IC-planar graphs. - Yuanyuan Duan; Lianying Miao; Wenyao Song (Discuss. Math. Graph Theory, 2020)

Acyclic Coloring of Graphs with Maximum Degree 7. - Juan Wang; Lianying Miao; Wenyao Song; Yunlong Liu 002 (Graphs Comb., 2021)

Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance. - Yunchao Hong; Lianying Miao (Discret. Appl. Math., 2022)

Acyclic coloring of claw-free graphs with small degree. - Juan Wang; Zuosong Liang; Jiansheng Cai; Lianying Miao (Discret. Appl. Math., 2022)

2-distance coloring of planar graphs with maximum degree 5. - Ming Chen; Lianying Miao; Shan Zhou (Discret. Math., 2022)

On the spectral radius, energy and Estrada index of the arithmetic-geometric matrix of a graph. - Zhen Lin; Bo Deng; Lianying Miao; He Li (Discret. Math. Algorithms Appl., 2022)

Optimal frequency assignment and planar list L(2, 1)-labeling. - Haiyang Zhu; Junlei Zhu; Ying Liu; Shuling Wang; Danjun Huang; Lianying Miao (J. Comb. Optim., 2022)

Acyclic chromatic index of IC-planar graphs. - Wenyao Song; Lianying Miao; Yueying Zhao; Haiyang Zhu (Discuss. Math. Graph Theory, 2023)

Coloring Squares of Planar Graphs with Maximum Degree at Most Five. - Jianfeng Hou; Yindong Jin; Lianying Miao; Qian Zhao (Graphs Comb., 2023)

On Graphs of Order n with Metric Dimension n-4. - Juan Wang; Fenglei Tian; Yunlong Liu; Jingru Pang; Lianying Miao (Graphs Comb., 2023)

On L(p,q)-labelling of planar graphs without cycles of length four. - Jianfeng Hou; Yindong Jin; Heng Li; Lianying Miao; Qian Zhao (Appl. Math. Comput., 2023)

On the eccentric distance sum of trees with given maximum degree. - Ting Zhou; Lianying Miao; Wenyao Song (Discret. Appl. Math., 2024)

An improvement of the bound on the improper odd chromatic number of IC-planar graphs. - Shanshan Zhang; Lianying Miao; Xiaoya Li (Discret. Appl. Math., 2025)

Acyclic total coloring of graphs with large girths. - Xiaoya Li; Wenyao Song; Lianying Miao (Ars Comb., 2025)