Lianying Miao

Orcid: 0000-0003-1167-2219

According to our database¹, Lianying Miao authored at least 44 papers between 2002 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

On L(p,q)-labelling of planar graphs without cycles of length four.

[BibT_eX]

[DOI]

Appl. Math. Comput., June, 2023

On Graphs of Order n with Metric Dimension n-4.

[BibT_eX]

[DOI]

Graphs Comb., April, 2023

Coloring Squares of Planar Graphs with Maximum Degree at Most Five.

[BibT_eX]

[DOI]

Graphs Comb., April, 2023

Acyclic chromatic index of IC-planar graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

2022

Optimal frequency assignment and planar list L(2, 1)-labeling.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

On the spectral radius, energy and Estrada index of the arithmetic-geometric matrix of a graph.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2022

2-distance coloring of planar graphs with maximum degree 5.

[BibT_eX]

[DOI]

Ming Chen

Lianying Miao

Shan Zhou

Discret. Math., 2022

Acyclic coloring of claw-free graphs with small degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance.

[BibT_eX]

[DOI]

Yunchao Hong

Lianying Miao

Discret. Appl. Math., 2022

2021

Acyclic Coloring of Graphs with Maximum Degree 7.

[BibT_eX]

[DOI]

Graphs Comb., 2021

2020

Neighbor sum distinguishing total choosability of IC-planar graphs.

[BibT_eX]

[DOI]

Yuanyuan Duan

Lianying Miao

Wenyao Song

Discuss. Math. Graph Theory, 2020

Acyclic L-coloring of graphs with maximum degrees 5 and 6.

[BibT_eX]

[DOI]

Juan Wang

Lianying Miao

Wenyao Song

Discret. Math., 2020

Neighbor sum distinguishing total coloring of IC-planar graphs.

[BibT_eX]

[DOI]

Wenyao Song

Yuanyuan Duan

Lianying Miao

Discret. Math., 2020

On the extremal values of the eccentric distance sum of trees with a given maximum degree.

[BibT_eX]

[DOI]

Lianying Miao

Jingru Pang

Shoujun Xu

Discret. Appl. Math., 2020

The List L(2, 1)-Labeling of Planar Graphs with Large Girth.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Acyclic coloring of graphs with maximum degree at most six.

[BibT_eX]

[DOI]

Juan Wang

Lianying Miao

Discret. Math., 2019

2018

Sensitivity of r-hued colouring of graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2018

The list L(2, 1)-labeling of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Neighbor sum distinguishing total coloring of sparse IC-planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Synchronization of time-delayed systems with discontinuous coupling.

[BibT_eX]

[DOI]

Hong-jun Shi

Lianying Miao

Yong-zheng Sun

Kybernetika, 2017

On list r-hued coloring of planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Strong edge-coloring of planar graphs.

[BibT_eX]

[DOI]

Lianying Miao

Wenyao Song

Discuss. Math. Graph Theory, 2017

On the extremal values of the eccentric distance sum of trees with a given domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Element deletion changes in dynamic coloring of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

On the extremal values of the eccentric distance sum of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

On the algorithmic complexity of edge total domination.

[BibT_eX]

[DOI]

Yancai Zhao

Zuhua Liao

Lianying Miao

Theor. Comput. Sci., 2014

Maximal matching and edge domination in complete multipartite graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

On the size of critical graphs with small maximum degree.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

On the independence number of edge chromatic critical graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

Acyclic vertex coloring of graphs of maximum degree six.

[BibT_eX]

[DOI]

Discret. Math., 2014

2013

L(p, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees.

[BibT_eX]

[DOI]

Discret. Math., 2013

2011

New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the average degree of critical graphs with maximum degree six.

[BibT_eX]

[DOI]

Lianying Miao

Jibin Qu

Qingbo Sun

Discret. Math., 2011

On the Independence Number of Edge Chromatic Critical Graphs.

[BibT_eX]

Lianying Miao

Ars Comb., 2011

The Δ2-conjecture for L(2, 1)-labelings is true for total graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

On the size of critical graphs with maximum degree 8.

[BibT_eX]

[DOI]

Lianying Miao

Qingbo Sun

Discret. Math., 2010

2009

The size of edge chromatic critical graphs with maximum degree 6.

[BibT_eX]

[DOI]

Rong Luo

Lianying Miao

Yue Zhao

J. Graph Theory, 2009

Every line graph of a 4-edge-connected graph is I-connected.

[BibT_eX]

[DOI]

Hong-Jian Lai

Lianying Miao

Yehong Shao

Eur. J. Comb., 2009

The Clique Minor of Graphs with Independence Number Two.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2009

2008

On the size of edge-coloring critical graphs with maximum degree 4.

[BibT_eX]

[DOI]

Lianying Miao

Shiyou Pang

Discret. Math., 2008

2007

On 3-choosability of plane graphs without 3-, 8- and 9-cycles.

[BibT_eX]

[DOI]

Xiaoying Zhu

Lianying Miao

Cuiqi Wang

Australas. J Comb., 2007

2006

The Dynamic Coloring Numbers of Pseudo-Halin Graphs.

[BibT_eX]

Ars Comb., 2006

2003

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.

[BibT_eX]

[DOI]

Lianying Miao

Shiyou Pang

Jianliang Wu

Discret. Math., 2003

2002

Edge-coloring critical graphs with high degree.

[BibT_eX]

[DOI]

Lianying Miao

Jianliang Wu

Discret. Math., 2002

Lianying Miao

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...