default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLianying Miao
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]Ting Zhou, Lianying Miao, Wenyao Song:
On the eccentric distance sum of trees with given maximum degree. Discret. Appl. Math. 348: 79-86 (2024)- 2023
- [j43]Jianfeng Hou, Yindong Jin, Heng Li, Lianying Miao, Qian Zhao:
On L(p,q)-labelling of planar graphs without cycles of length four. Appl. Math. Comput. 446: 127884 (2023) - [j42]Wenyao Song
, Lianying Miao, Yueying Zhao, Haiyang Zhu:
Acyclic chromatic index of IC-planar graphs. Discuss. Math. Graph Theory 43(4): 965-978 (2023) - [j41]Jianfeng Hou, Yindong Jin, Lianying Miao, Qian Zhao:
Coloring Squares of Planar Graphs with Maximum Degree at Most Five. Graphs Comb. 39(2): 20 (2023) - [j40]Juan Wang, Fenglei Tian, Yunlong Liu, Jingru Pang, Lianying Miao:
On Graphs of Order n with Metric Dimension n-4. Graphs Comb. 39(2): 29 (2023) - 2022
- [j39]Yunchao Hong, Lianying Miao:
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance. Discret. Appl. Math. 321: 147-158 (2022) - [j38]Juan Wang, Zuosong Liang, Jiansheng Cai, Lianying Miao:
Acyclic coloring of claw-free graphs with small degree. Discret. Appl. Math. 321: 272-280 (2022) - [j37]Ming Chen, Lianying Miao, Shan Zhou:
2-distance coloring of planar graphs with maximum degree 5. Discret. Math. 345(4): 112766 (2022) - [j36]Zhen Lin, Bo Deng, Lianying Miao, He Li:
On the spectral radius, energy and Estrada index of the arithmetic-geometric matrix of a graph. Discret. Math. Algorithms Appl. 14(2): 2150108:1-2150108:20 (2022) - [j35]Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao:
Optimal frequency assignment and planar list L(2, 1)-labeling. J. Comb. Optim. 44(4): 2748-2761 (2022) - 2021
- [j34]Juan Wang, Lianying Miao, Wenyao Song, Yunlong Liu:
Acyclic Coloring of Graphs with Maximum Degree 7. Graphs Comb. 37(2): 455-469 (2021) - 2020
- [j33]Lianying Miao, Jingru Pang, Shoujun Xu:
On the extremal values of the eccentric distance sum of trees with a given maximum degree. Discret. Appl. Math. 284: 375-383 (2020) - [j32]Juan Wang, Lianying Miao, Wenyao Song:
Acyclic L-coloring of graphs with maximum degrees 5 and 6. Discret. Math. 343(1): 111584 (2020) - [j31]Wenyao Song, Yuanyuan Duan, Lianying Miao:
Neighbor sum distinguishing total coloring of IC-planar graphs. Discret. Math. 343(8): 111918 (2020) - [j30]Yuanyuan Duan, Lianying Miao, Wenyao Song:
Neighbor sum distinguishing total choosability of IC-planar graphs. Discuss. Math. Graph Theory 40(1): 331-344 (2020) - [c1]Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao:
The List L(2, 1)-Labeling of Planar Graphs with Large Girth. AAIM 2020: 501-512
2010 – 2019
- 2019
- [j29]Juan Wang, Lianying Miao:
Acyclic coloring of graphs with maximum degree at most six. Discret. Math. 342(11): 3025-3033 (2019) - 2018
- [j28]Wenyao Song, Lianying Miao, Jinbo Li, Yueying Zhao, Jingru Pang:
Neighbor sum distinguishing total coloring of sparse IC-planar graphs. Discret. Appl. Math. 239: 183-192 (2018) - [j27]Haiyang Zhu, Lianying Miao, Sheng Chen, Xinzhong Lü, Wenyao Song:
The list L(2, 1)-labeling of planar graphs. Discret. Math. 341(8): 2211-2219 (2018) - [j26]Huimin Song, Lianying Miao, Zhengke Miao, Hong-Jian Lai:
Sensitivity of r-hued colouring of graphs. Int. J. Comput. Math. Comput. Syst. Theory 3(4): 262-273 (2018) - 2017
- [j25]Lianying Miao, Shiyou Pang, Fang Liu, Eryan Wang, Xiaoqing Guo:
On the extremal values of the eccentric distance sum of trees with a given domination number. Discret. Appl. Math. 229: 113-120 (2017) - [j24]Lianying Miao, Wenyao Song:
Strong edge-coloring of planar graphs. Discuss. Math. Graph Theory 37(4): 845-857 (2017) - [j23]Haiyang Zhu, Sheng Chen, Lianying Miao, Xinzhong Lv:
On list r-hued coloring of planar graphs. J. Comb. Optim. 34(3): 874-890 (2017) - [j22]Hong-jun Shi, Lianying Miao, Yong-zheng Sun:
Synchronization of time-delayed systems with discontinuous coupling. Kybernetika 53(5): 765-779 (2017) - 2016
- [j21]Lianying Miao, Hong-Jian Lai, Yan-Fang Guo, Zhengke Miao:
Element deletion changes in dynamic coloring of graphs. Discret. Math. 339(5): 1600-1604 (2016) - 2015
- [j20]Lianying Miao, Qianqiu Cao, Na Cui, Shiyou Pang:
On the extremal values of the eccentric distance sum of trees. Discret. Appl. Math. 186: 199-206 (2015) - 2014
- [j19]Yancai Zhao, Lianying Miao, Shiyou Pang, Wenyao Song:
Acyclic vertex coloring of graphs of maximum degree six. Discret. Math. 325: 17-22 (2014) - [j18]Lianying Miao, Zhengke Miao, Shiyou Pang, Wenyao Song:
On the independence number of edge chromatic critical graphs. Discuss. Math. Graph Theory 34(3): 577-584 (2014) - [j17]Wenyao Song, Lianying Miao, Haichao Wang, Yancai Zhao:
Maximal matching and edge domination in complete multipartite graphs. Int. J. Comput. Math. 91(5): 857-862 (2014) - [j16]Lianying Miao, Wenyao Song, Shiyou Pang, Zhengke Miao:
On the size of critical graphs with small maximum degree. Int. J. Comput. Math. 91(10): 2142-2151 (2014) - [j15]Yancai Zhao, Zuhua Liao, Lianying Miao:
On the algorithmic complexity of edge total domination. Theor. Comput. Sci. 557: 28-33 (2014) - 2013
- [j14]Ziming Duan, Lianying Miao, Cuiqi Wang, Zhengke Miao:
L(p, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees. Discret. Math. 313(20): 2330-2336 (2013) - 2011
- [j13]Ziming Duan, Pingli Lv, Lianying Miao, Zhengke Miao, Cuiqi Wang:
The Δ2-conjecture for L(2, 1)-labelings is true for total graphs. Appl. Math. Lett. 24(9): 1491-1494 (2011) - [j12]Lianying Miao:
On the Independence Number of Edge Chromatic Critical Graphs. Ars Comb. 98: 471-481 (2011) - [j11]Lianying Miao, Jibin Qu, Qingbo Sun:
On the average degree of critical graphs with maximum degree six. Discret. Math. 311(21): 2574-2576 (2011) - [j10]Ziming Duan, Pingli Lv, Lianying Miao, Zhengke Miao, Cuiqi Wang:
New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs. Theor. Comput. Sci. 412(22): 2393-2397 (2011) - 2010
- [j9]Lianying Miao, Qingbo Sun:
On the size of critical graphs with maximum degree 8. Discret. Math. 310(15-16): 2215-2218 (2010)
2000 – 2009
- 2009
- [j8]Shiyou Pang, Lianying Miao, Qingbo Sun, Zhengke Miao:
The Clique Minor of Graphs with Independence Number Two. Discret. Math. Algorithms Appl. 1(1): 121-126 (2009) - [j7]Hong-Jian Lai, Lianying Miao, Yehong Shao:
Every line graph of a 4-edge-connected graph is I-connected. Eur. J. Comb. 30(2): 595-601 (2009) - [j6]Rong Luo, Lianying Miao, Yue Zhao:
The size of edge chromatic critical graphs with maximum degree 6. J. Graph Theory 60(2): 149-171 (2009) - 2008
- [j5]Lianying Miao, Shiyou Pang:
On the size of edge-coloring critical graphs with maximum degree 4. Discret. Math. 308(23): 5856-5859 (2008) - 2007
- [j4]Xiaoying Zhu, Lianying Miao, Cuiqi Wang:
On 3-choosability of plane graphs without 3-, 8- and 9-cycles. Australas. J Comb. 38: 249-254 (2007) - 2006
- [j3]Xianyong Meng, Lianying Miao, Bentang Su, Rensuo Li:
The Dynamic Coloring Numbers of Pseudo-Halin Graphs. Ars Comb. 79 (2006) - 2003
- [j2]Lianying Miao, Shiyou Pang, Jianliang Wu:
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. Discret. Math. 271(1-3): 321-325 (2003) - 2002
- [j1]Lianying Miao, Jianliang Wu:
Edge-coloring critical graphs with high degree. Discret. Math. 257(1): 169-172 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-23 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
