Lianying Miao

46 papers C 1Journal 45
YearRankTypeTitle / Venue / Authors
2025 J jnl
Acyclic total coloring of graphs with large girths.
Ars Comb.
Xiaoya Li, Wenyao Song, Lianying Miao
2025 J jnl
An improvement of the bound on the improper odd chromatic number of IC-planar graphs.
Discret. Appl. Math.
Shanshan Zhang, Lianying Miao, Xiaoya Li
2024 J jnl
On the eccentric distance sum of trees with given maximum degree.
Discret. Appl. Math.
Ting Zhou, Lianying Miao, Wenyao Song
2023 J jnl
Acyclic chromatic index of IC-planar graphs.
Discuss. Math. Graph Theory
Wenyao Song, Lianying Miao, Yueying Zhao, Haiyang Zhu
2023 J jnl
Coloring Squares of Planar Graphs with Maximum Degree at Most Five.
Graphs Comb.
Jianfeng Hou, Yindong Jin, Lianying Miao, Qian Zhao
2023 J jnl
On Graphs of Order n with Metric Dimension n-4.
Graphs Comb.
Juan Wang, Fenglei Tian, Yunlong Liu, Jingru Pang, Lianying Miao
2023 J jnl
On L(p,q)-labelling of planar graphs without cycles of length four.
Appl. Math. Comput.
Jianfeng Hou, Yindong Jin, Heng Li, Lianying Miao, Qian Zhao
2022 J jnl
2-distance coloring of planar graphs with maximum degree 5.
Discret. Math.
Ming Chen, Lianying Miao, Shan Zhou
2022 J jnl
Acyclic coloring of claw-free graphs with small degree.
Discret. Appl. Math.
Juan Wang, Zuosong Liang, Jiansheng Cai, Lianying Miao
2022 J jnl
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance.
Discret. Appl. Math.
Yunchao Hong, Lianying Miao
2022 J jnl
On the spectral radius, energy and Estrada index of the arithmetic-geometric matrix of a graph.
Discret. Math. Algorithms Appl.
Zhen Lin, Bo Deng, Lianying Miao, He Li
2022 J jnl
Optimal frequency assignment and planar list L(2, 1)-labeling.
J. Comb. Optim.
Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao
2021 J jnl
Acyclic Coloring of Graphs with Maximum Degree 7.
Graphs Comb.
Juan Wang, Lianying Miao, Wenyao Song, Yunlong Liu
2020 J jnl
Acyclic L-coloring of graphs with maximum degrees 5 and 6.
Discret. Math.
Juan Wang, Lianying Miao, Wenyao Song
2020 J jnl
Neighbor sum distinguishing total choosability of IC-planar graphs.
Discuss. Math. Graph Theory
Yuanyuan Duan, Lianying Miao, Wenyao Song
2020 J jnl
Neighbor sum distinguishing total coloring of IC-planar graphs.
Discret. Math.
Wenyao Song, Yuanyuan Duan, Lianying Miao
2020 J jnl
On the extremal values of the eccentric distance sum of trees with a given maximum degree.
Discret. Appl. Math.
Lianying Miao, Jingru Pang, Shoujun Xu
2020 C conf
The List L(2, 1)-Labeling of Planar Graphs with Large Girth.
AAIM
Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao
2019 J jnl
Acyclic coloring of graphs with maximum degree at most six.
Discret. Math.
Juan Wang, Lianying Miao
2018 J jnl
Neighbor sum distinguishing total coloring of sparse IC-planar graphs.
Discret. Appl. Math.
Wenyao Song, Lianying Miao, Jinbo Li, Yueying Zhao, Jingru Pang
2018 J jnl
Sensitivity of r-hued colouring of graphs.
Int. J. Comput. Math. Comput. Syst. Theory
Huimin Song, Lianying Miao, Zhengke Miao, Hong-Jian Lai
2018 J jnl
The list L(2, 1)-labeling of planar graphs.
Discret. Math.
Haiyang Zhu, Lianying Miao, Sheng Chen, Xinzhong Lü, Wenyao Song
2017 J jnl
On list r-hued coloring of planar graphs.
J. Comb. Optim.
Haiyang Zhu, Sheng Chen, Lianying Miao, Xinzhong Lv
2017 J jnl
On the extremal values of the eccentric distance sum of trees with a given domination number.
Discret. Appl. Math.
Lianying Miao, Shiyou Pang, Fang Liu, Eryan Wang, Xiaoqing Guo
2017 J jnl
Strong edge-coloring of planar graphs.
Discuss. Math. Graph Theory
Lianying Miao, Wenyao Song
2017 J jnl
Synchronization of time-delayed systems with discontinuous coupling.
Kybernetika
Hong-jun Shi, Lianying Miao, Yong-zheng Sun
2016 J jnl
Element deletion changes in dynamic coloring of graphs.
Discret. Math.
Lianying Miao, Hong-Jian Lai, Yan-Fang Guo, Zhengke Miao
2015 J jnl
On the extremal values of the eccentric distance sum of trees.
Discret. Appl. Math.
Lianying Miao, Qianqiu Cao, Na Cui, Shiyou Pang
2014 J jnl
Acyclic vertex coloring of graphs of maximum degree six.
Discret. Math.
Yancai Zhao, Lianying Miao, Shiyou Pang, Wenyao Song
2014 J jnl
Maximal matching and edge domination in complete multipartite graphs.
Int. J. Comput. Math.
Wenyao Song, Lianying Miao, Haichao Wang, Yancai Zhao
2014 J jnl
On the algorithmic complexity of edge total domination.
Theor. Comput. Sci.
Yancai Zhao, Zuhua Liao, Lianying Miao
2014 J jnl
On the independence number of edge chromatic critical graphs.
Discuss. Math. Graph Theory
Lianying Miao, Zhengke Miao, Shiyou Pang, Wenyao Song
2014 J jnl
On the size of critical graphs with small maximum degree.
Int. J. Comput. Math.
Lianying Miao, Wenyao Song, Shiyou Pang, Zhengke Miao
2011 J jnl
New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs.
Theor. Comput. Sci.
Ziming Duan, Pingli Lv, Lianying Miao, Zhengke Miao, Cuiqi Wang
2011 J jnl
On the Independence Number of Edge Chromatic Critical Graphs.
Ars Comb.
Lianying Miao
2011 J jnl
On the average degree of critical graphs with maximum degree six.
Discret. Math.
Lianying Miao, Jibin Qu, Qingbo Sun
2011 J jnl
The Δ
Appl. Math. Lett.
Ziming Duan, Pingli Lv, Lianying Miao, Zhengke Miao, Cuiqi Wang
2010 J jnl
On the size of critical graphs with maximum degree 8.
Discret. Math.
Lianying Miao, Qingbo Sun
2009 J jnl
Every line graph of a 4-edge-connected graph is
Eur. J. Comb.
Hong-Jian Lai, Lianying Miao, Yehong Shao
2009 J jnl
The Clique Minor of Graphs with Independence Number Two.
Discret. Math. Algorithms Appl.
Shiyou Pang, Lianying Miao, Qingbo Sun, Zhengke Miao
2009 J jnl
The size of edge chromatic critical graphs with maximum degree 6.
J. Graph Theory
Rong Luo, Lianying Miao, Yue Zhao
2008 J jnl
On the size of edge-coloring critical graphs with maximum degree 4.
Discret. Math.
Lianying Miao, Shiyou Pang
2007 J jnl
On 3-choosability of plane graphs without 3-, 8- and 9-cycles.
Australas. J Comb.
Xiaoying Zhu, Lianying Miao, Cuiqi Wang
2006 J jnl
The Dynamic Coloring Numbers of Pseudo-Halin Graphs.
Ars Comb.
Xianyong Meng, Lianying Miao, Bentang Su, Rensuo Li
2003 J jnl
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.
Discret. Math.
Lianying Miao, Shiyou Pang, Jianliang Wu
2002 J jnl
Edge-coloring critical graphs with high degree.
Discret. Math.
Lianying Miao, Jianliang Wu