Xueliang Li

ORCID

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 90

Top Venues

J. Comb. Optim.

Discuss. Math. Graph Theory

Discret. Appl. Math.

Discret. Math.

Publications

Jie Hu, Luyi Li, Xueliang Li, Ningyan Xu
Vertex-bipancyclicity in a bipartite graph collection. Discret. Math. 347 (7) (2024)
Xiaozheng Chen, Luyi Li, Xueliang Li
Edge-disjoint properly colored cycles in edge-colored complete graphs. Discret. Appl. Math. 350 (2024)
Xueliang Li, Yuan Si
Gallai-Ramsey Multiplicity for Rainbow Small Trees. Graphs Comb. 40 (4) (2024)
Luyi Li, Xueliang Li, Yuan Si
Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles. Discret. Appl. Math. 344 (2024)
Xiaozheng Chen, Xueliang Li
Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs. Discret. Math. 346 (1) (2023)
Yanhong Gao, Ping Li, Xueliang Li
Extremal graphs and classification of planar graphs by MC-numbers. Discuss. Math. Graph Theory 43 (4) (2023)
Luyi Li, Ping Li, Xueliang Li
Rainbow structures in a collection of graphs with degree conditions. J. Graph Theory 104 (2) (2023)
Xuqing Bai, Renying Chang, Zhong Huang, Xueliang Li
More on the rainbow disconnection in graphs. Discuss. Math. Graph Theory 42 (4) (2022)
Luyi Li, Xueliang Li
Edge-disjoint rainbow triangles in edge-colored graphs. Discret. Appl. Math. 318 (2022)
Xiaozheng Chen, Xueliang Li
Note on rainbow cycles in edge-colored graphs. Discret. Math. 345 (12) (2022)
Luyi Li, Xueliang Li
Rainbow edge-pancyclicity of strongly edge-colored graphs. Theor. Comput. Sci. 907 (2022)
Xiaozheng Chen, Xueliang Li, Bo Ning
Note on Rainbow Triangles in Edge-Colored Graphs. Graphs Comb. 38 (3) (2022)
Ping Li, Xueliang Li
Monochromatic disconnection: Erdős-Gallai-type problems and product graphs. J. Comb. Optim. 44 (1) (2022)
You Chen, Xueliang Li
The proper vertex-disconnection of graphs. Theor. Comput. Sci. 923 (2022)
Yanhong Gao, Ping Li, Xueliang Li
Further results on the total monochromatic connectivity of graphs. J. Comb. Optim. 44 (1) (2022)
Jiaao Li, Xueliang Li, Meiling Wang
The Flow Index of Regular Class I Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Luyi Li, Xueliang Li
Vertex-disjoint rainbow cycles in edge-colored graphs. Discret. Math. 345 (7) (2022)
Xueliang Li, Hengzhe Li, Yingbin Ma
The vertex- rainbow connection number of some graph operations. Discuss. Math. Graph Theory 41 (2) (2021)
Ping Li, Xueliang Li
Rainbow Monochromatic k-Edge-Connection Colorings of Graphs. Graphs Comb. 37 (3) (2021)
Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang
Conflict-free connection of trees. J. Comb. Optim. 42 (3) (2021)
Luyi Li, Xueliang Li
Digraphs with proper connection number two. Theor. Comput. Sci. 873 (2021)
You Chen, Ping Li, Xueliang Li, Yindi Weng
Complexity results for two kinds of colored disconnections of graphs. J. Comb. Optim. 42 (1) (2021)
Hui Jiang, Wenjing Li, Xueliang Li, Colton Magnant
On proper (strong) rainbow connection of graphs. Discuss. Math. Graph Theory 41 (2) (2021)
Xiaozheng Chen, Xueliang Li
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles. Discret. Appl. Math. 294 (2021)
Ping Li, Xueliang Li
Monochromatic disconnection of graphs. Discret. Appl. Math. 288 (2021)
Modjtaba Ghorbani, Xueliang Li, Samaneh Zangi, Najaf Amraei
On the eigenvalue and energy of extended adjacency matrix. Appl. Math. Comput. 397 (2021)
Ping Li, Xueliang Li
Upper bounds for the MD-numbers and characterization of extremal graphs. Discret. Appl. Math. 295 (2021)
Miaomiao Han, Jiaao Li, Xueliang Li, Meiling Wang
Group connectivity under 3-edge-connectivity. J. Graph Theory 96 (3) (2021)
Ping Li, Xueliang Li
Monochromatic k-edge-connection colorings of graphs. Discret. Math. 343 (2) (2020)
Ran Gu, Xueliang Li
Conflict-free connection number of random graphs. Discret. Appl. Math. 283 (2020)
Xueliang Li, Yiyang Li, Jiarong Song
The asymptotic value of graph energy for random graphs with degree-based weights. Discret. Appl. Math. 284 (2020)
Jiaao Li, Xueliang Li, Meiling Wang
Spanning Triangle-Trees and Flows of Graphs. Graphs Comb. 36 (6) (2020)
Xuqing Bai, Xueliang Li
Strong rainbow disconnection in graphs. CoRR (2020)
Zemin Jin, Xueliang Li, Yirong Yang
Extremal graphs with maximum monochromatic connectivity. Discret. Math. 343 (9) (2020)
Meng Ji, Xueliang Li, Xiaoyu Zhu
(Strong) conflict-free connectivity: Algorithm and complexity. Theor. Comput. Sci. 804 (2020)
Stanislav Jendrol', Xueliang Li, Yaping Mao, Yingying Zhang, Haixing Zhao, Xiaoyu Zhu
Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40 (1) (2020)
Meng Ji, Xueliang Li
Strong conflict-free connection of graphs. Appl. Math. Comput. 364 (2020)
You Chen, Ping Li, Xueliang Li, Yindi Weng
Complexity Results for the Proper Disconnection of Graphs. FAW (2020)
Jiaao Li, Xueliang Li, Meiling Wang
Complementary graphs with flows less than three. Discret. Math. 343 (5) (2020)
Zhiwei Guo, Binlong Li, Xueliang Li, Shenggui Zhang
Compatible spanning circuits in edge-colored graphs. Discret. Math. 343 (7) (2020)
Xuqing Bai, Xueliang Li
Graph colorings under global structural conditions. CoRR (2020)
Modjtaba Ghorbani, Mardjan Hakimi-Nezhaad, Matthias Dehmer, Xueliang Li
Analysis of the Graovac-Pisanski Index of Some Polyhedral Graphs Based on Their Symmetry Group. Symmetry 12 (9) (2020)
Zhong Huang, Xueliang Li
Hardness results for three kinds of colored connections of graphs. CoRR (2020)
Xuqing Bai, Hong Chang, Xueliang Li
More on limited packings in graphs. J. Comb. Optim. 40 (2) (2020)
Zhong Huang, Xueliang Li
Hardness results for three kinds of colored connections of graphs. Theor. Comput. Sci. 841 (2020)
Xueliang Li, Xiaoyu Zhu
Conflict-free (vertex-)connection numbers of graphs with small diameters. Australas. J Comb. 76 (2020)
Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant
Minimum degree condition for proper connection number 2. Theor. Comput. Sci. 774 (2019)
Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao, Haixing Zhao
On conflict-free connection of graphs. Discret. Appl. Math. 255 (2019)
You Chen, Ping Li, Xueliang Li, Yindi Weng
Complexity results for the proper disconnection of graphs. CoRR (2019)
Xueliang Li, Xiaoyu Zhu
-regular graphs. Discuss. Math. Graph Theory 39 (4) (2019)
Hui Jiang, Xueliang Li, Yingying Zhang
Erdős-Gallai-type results for total monochromatic connection of graphs. Discuss. Math. Graph Theory 39 (4) (2019)
Xueliang Li, Wen Xia
Skew-rank of an oriented graph and independence number of its underlying graph. J. Comb. Optim. 38 (1) (2019)
Lin Chen, Xueliang Li, Henry Liu, Jinfeng Liu
On various (strong) rainbow connection numbers of graphs. Australas. J Comb. 70 (2018)
Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34 (6) (2018)
Zhiwei Guo, Xueliang Li, Chuandong Xu, Shenggui Zhang
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. Discret. Math. 341 (7) (2018)
Ivan Gutman, Xueliang Li, Yaping Mao
Inverse problem on the Steiner Wiener index. Discuss. Math. Graph Theory 38 (1) (2018)
Wenjing Li, Xueliang Li, Jingshu Zhang
Rainbow vertex-connection and forbidden subgraphs. Discuss. Math. Graph Theory 38 (1) (2018)
Meng Ji, Xueliang Li, Xiaoyu Zhu
Conflict-free connections: algorithm and complexity. CoRR (2018)
Zhong Huang, Xueliang Li
Hardness results for rainbow disconnection of graphs. CoRR (2018)
Xueliang Li, Yan Zhao
vertices. Australas. J Comb. 70 (2018)
Ran Gu, Xueliang Li, Zhongmei Qin, Yongtang Shi, Kang Yang
Non-jumping numbers for 5-uniform hypergraphs. Appl. Math. Comput. 317 (2018)
Qingqiong Cai, Xueliang Li, Di Wu
Some extremal results on the colorful monochromatic vertex-connectivity of a graph. J. Comb. Optim. 35 (4) (2018)
Hui Jiang, Xueliang Li, Yingying Zhang
More on total monochromatic connection of graphs. Ars Comb. 136 (2018)
Xueliang Li, Colton Magnant, Meiqin Wei, Xiaoyu Zhu
Generalized rainbow connection of graphs and their complements. Discuss. Math. Graph Theory 38 (2) (2018)
Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin
The (k , ℓ)-proper index of graphs. J. Comb. Optim. 36 (2) (2018)
Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang
Conflict-free connection of trees. CoRR (2017)
Wenjing Li, Xueliang Li, Di Wu
Hardness result for the total rainbow k-connection of graphs. Appl. Math. Comput. 305 (2017)
Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang
The von Neumann entropy of random multipartite graphs. Discret. Appl. Math. 232 (2017)
Hui Jiang, Xueliang Li, Yingying Zhang
Total monochromatic connection of graphs. Discret. Math. 340 (2) (2017)
Wenjing Li, Xueliang Li, Jingshu Zhang
The k-proper index of complete bipartite and complete multipartite graphs. Australas. J Comb. 68 (2017)
Qingqiong Cai, Xueliang Li, Di Wu
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. J. Comb. Optim. 33 (1) (2017)
Jiansheng Cai, Xueliang Li, Guiying Yan
Improved upper bound for the degenerate and star chromatic numbers of graphs. J. Comb. Optim. 34 (2) (2017)
Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki
On two conjectures about the proper connection number of graphs. Discret. Math. 340 (9) (2017)
Lin Chen, Xueliang Li, Jinfeng Liu
The k-proper index of graphs. Appl. Math. Comput. 296 (2017)
Fei Huang, Xueliang Li, Shujing Wang
Upper bounds of proper connection number of graphs. J. Comb. Optim. 34 (1) (2017)
Yuefang Sun, Xueliang Li
On the difference of two generalized connectivities of a graph. J. Comb. Optim. 33 (1) (2017)
Xueliang Li, Di Wu
The (vertex-)monochromatic index of a graph. J. Comb. Optim. 33 (4) (2017)
Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao
A solution to a conjecture on the generalized connectivity of graphs. J. Comb. Optim. 33 (1) (2017)
Wenjing Li, Xueliang Li, Jingshu Zhang
3-Rainbow Index and Forbidden Subgraphs. Graphs Comb. 33 (4) (2017)
Xueliang Li, Hengzhe Li, Yuefang Sun
Rainbow connection number of graphs with diameter 3. Discuss. Math. Graph Theory 37 (1) (2017)
Bo Deng, Wenjing Li, Xueliang Li, Yaping Mao, Haixing Zhao
Conflict-Free Connection Numbers of Line Graphs. COCOA (1) (2017)
Ivan Gutman, Xueliang Li, Yaping Mao
The Steiner Wiener index of a graph. Discuss. Math. Graph Theory 36 (2) (2016)
Ruihu Li, Qiang Fu, Luobin Guo, Xueliang Li
, 4) and quantum codes of distance 4. Quantum Inf. Process. 15 (2) (2016)
Xueliang Li, Yaping Mao
Graphs with large generalized (edge-)connectivity. Discuss. Math. Graph Theory 36 (4) (2016)
Qingqiong Cai, Xueliang Li, Yan Zhao
The 3-rainbow index and connected dominating sets. J. Comb. Optim. 31 (3) (2016)
Ran Gu, Xueliang Li, Zhongmei Qin
Proper connection number of random graphs. Theor. Comput. Sci. 609 (2016)
Qingqiong Cai, Xueliang Li, Yan Zhao
Note on the upper bound of the rainbow index of a graph. Discret. Appl. Math. 209 (2016)
Ran Gu, Xueliang Li, Yuejian Peng, Yongtang Shi
Some Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 31 (1) (2016)
Jiuying Dong, Xueliang Li
Rainbow Connection Number and Independence Number of a Graph. Graphs Comb. 32 (5) (2016)
Hui Jiang, Xueliang Li, Yingying Zhang
Upper bounds for the total rainbow connection of graphs. J. Comb. Optim. 32 (1) (2016)
Fei Huang, Xueliang Li, Shujing Wang
On graphs with maximum Harary spectral radius. Appl. Math. Comput. 266 (2015)
Xueliang Li, Yaping Mao
On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. Graphs Comb. 31 (6) (2015)
Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao
-2. Discuss. Math. Graph Theory 35 (1) (2015)
Xueliang Li, Yongtang Shi, Martin Trinks
Polynomial reconstruction of the matching polynomial. Electron. J. Graph Theory Appl. 3 (1) (2015)
Xiaolin Chen, Xueliang Li, Huishu Lian
Solution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs. Electron. J. Comb. 22 (1) (2015)
Xueliang Li, Meiqin Wei, Jun Yue
Proper connection number and connected dominating sets. Theor. Comput. Sci. 607 (2015)
Xueliang Li, Sujuan Liu
Rainbow Connection Number and the Number of Blocks. Graphs Comb. 31 (1) (2015)
Lily Chen, Xueliang Li, Kang Yang, Yan Zhao
The 3-rainbow index of a graph. Discuss. Math. Graph Theory 35 (1) (2015)
Xueliang Li, Yaping Mao
The minimal size of a graph with given generalized 3-edge-connectivity. Ars Comb. 118 (2015)
Jiuying Dong, Xueliang Li
An improved Fan-Type degree condition for k-linked graphs. Ars Comb. 121 (2015)

Xueliang Li.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Xueliang Li