default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXueliang Li 0001
李学良
Person information
- unicode name: 李学良
- affiliation: Nankai University, Center for Combinatorics, Tianjin, China
- affiliation (former): Northwestern Polytechnical University, Department of Applied Mathematics, Xi'an, China
- affiliation (former): Xinjiang University, Department of Mathematics, Urumchi, China
- affiliation (PhD 1991): University of Twente, Department of Applied Mathematics, Enschede, The Netherlands
Other persons with the same name
- Xueliang Li 0002
![[0000-0002-8928-9933]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8928-9933")
— Shenzhen University, College of Computer Science and Software Engineering, China (and 1 more) - Xueliang Li 0003 — LanzaTech Inc, Skokie, IL, USA (and 2 more)
- Xueliang Li 0004 — Chinese Academy of Sciences, Institute of Computing Technology, State Key Laboratory of Computer Architecture, Beijing, China
- Xueliang Li 0005 — Jiangnan University, School of Design, Wuxi, China
- Xueliang Li 0006 — Chinese Academy of Sciences, Key Laboratory of Petroleum Resources Research, Beijing, China
- Xueliang Li 0007 — Chinese Academy of Sciences, Changchun Institute of Optics, Fine Mechanics and Physics, China (and 1 more)
- Xueliang Li 0008 — Shandong Electric Power Economic Research Institute, Jinan, China
- Xueliang Li 0009 — Beijing University of Posts and Telecommunications, School of Electronic Engineering, China
- Xueliang Li 0010 — Central South University, MoE Key Laboratory of Traffic Safety on Track, Changsha, China
- Xueliang Li 0011 — Zhoukou Normal University, College of Physics and Telecommunication Engineering, China (and 1 more)
- Xueliang Li 0012 — Southern University of Science and Technology, Shenzhen, China
- Xueliang Li 0013 — Northwest A&F University, Yangling, China
- Xueliang Li 0014 — Institution of Education Luohu, Shenzhen, China
- Xueliang Li 0015 — Chinese Academy of Sciences, Institute of Geology and Geophysics, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j239]Jing Gao, Xueliang Li, Ning Yang, Ruiling Zheng:
Maximum energy bicyclic graphs containing two odd cycles with one common vertex. Discret. Appl. Math. 361: 1-21 (2025)- 2024
- [j238]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: 81-87 (2024) - [j237]Xiaozheng Chen, Luyi Li, Xueliang Li:
Edge-disjoint properly colored cycles in edge-colored complete graphs. Discret. Appl. Math. 350: 84-96 (2024) - [j236]Jie Hu, Luyi Li, Xueliang Li, Ningyan Xu:
Vertex-bipancyclicity in a bipartite graph collection. Discret. Math. 347(7): 113980 (2024) - [j235]Xueliang Li, Yuan Si:
Gallai-Ramsey Multiplicity for Rainbow Small Trees. Graphs Comb. 40(4): 91 (2024) - 2023
- [j234]Xueliang Li, Ning Yang:
Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights. Discret. Appl. Math. 333: 110-120 (2023) - [j233]Xiaozheng Chen, Xueliang Li:
Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs. Discret. Math. 346(1): 113197 (2023) - [j232]Yanhong Gao, Ping Li, Xueliang Li:
Extremal graphs and classification of planar graphs by MC-numbers. Discuss. Math. Graph Theory 43(4): 1253-1272 (2023) - [j231]Luyi Li, Ping Li, Xueliang Li:
Rainbow structures in a collection of graphs with degree conditions. J. Graph Theory 104(2): 341-359 (2023) - 2022
- [j230]Luyi Li, Xueliang Li:
Edge-disjoint rainbow triangles in edge-colored graphs. Discret. Appl. Math. 318: 21-30 (2022) - [j229]Luyi Li, Xueliang Li:
Vertex-disjoint rainbow cycles in edge-colored graphs. Discret. Math. 345(7): 112878 (2022) - [j228]Xiaozheng Chen, Xueliang Li:
Note on rainbow cycles in edge-colored graphs. Discret. Math. 345(12): 113082 (2022) - [j227]Xuqing Bai, Renying Chang, Zhong Huang, Xueliang Li:
More on the rainbow disconnection in graphs. Discuss. Math. Graph Theory 42(4): 1185-1204 (2022) - [j226]Xiaozheng Chen, Xueliang Li, Bo Ning:
Note on Rainbow Triangles in Edge-Colored Graphs. Graphs Comb. 38(3): 69 (2022) - [j225]Ping Li, Xueliang Li:
Monochromatic disconnection: Erdős-Gallai-type problems and product graphs. J. Comb. Optim. 44(1): 136-153 (2022) - [j224]Yanhong Gao, Ping Li, Xueliang Li:
Further results on the total monochromatic connectivity of graphs. J. Comb. Optim. 44(1): 603-616 (2022) - [j223]Jiaao Li, Xueliang Li, Meiling Wang:
The Flow Index of Regular Class I Graphs. SIAM J. Discret. Math. 36(3): 1991-2003 (2022) - [j222]Luyi Li, Xueliang Li:
Rainbow edge-pancyclicity of strongly edge-colored graphs. Theor. Comput. Sci. 907: 26-33 (2022) - [j221]You Chen, Xueliang Li:
The proper vertex-disconnection of graphs. Theor. Comput. Sci. 923: 167-178 (2022) - 2021
- [j220]Modjtaba Ghorbani, Xueliang Li, Samaneh Zangi, Najaf Amraei:
On the eigenvalue and energy of extended adjacency matrix. Appl. Math. Comput. 397: 125939 (2021) - [j219]Ping Li, Xueliang Li:
Monochromatic disconnection of graphs. Discret. Appl. Math. 288: 171-179 (2021) - [j218]Xiaozheng Chen, Xueliang Li:
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles. Discret. Appl. Math. 294: 167-180 (2021) - [j217]Ping Li, Xueliang Li:
Upper bounds for the MD-numbers and characterization of extremal graphs. Discret. Appl. Math. 295: 1-12 (2021) - [j216]Hui Jiang, Wenjing Li, Xueliang Li, Colton Magnant:
On proper (strong) rainbow connection of graphs. Discuss. Math. Graph Theory 41(2): 469-479 (2021) - [j215]Xueliang Li, Hengzhe Li, Yingbin Ma:
The vertex- rainbow connection number of some graph operations. Discuss. Math. Graph Theory 41(2): 513-530 (2021) - [j214]Ping Li, Xueliang Li:
Rainbow Monochromatic k-Edge-Connection Colorings of Graphs. Graphs Comb. 37(3): 1045-1064 (2021) - [j213]You Chen, Ping Li, Xueliang Li, Yindi Weng:
Complexity results for two kinds of colored disconnections of graphs. J. Comb. Optim. 42(1): 40-55 (2021) - [j212]Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang:
Conflict-free connection of trees. J. Comb. Optim. 42(3): 340-353 (2021) - [j211]Miaomiao Han, Jiaao Li, Xueliang Li, Meiling Wang:
Group connectivity under 3-edge-connectivity. J. Graph Theory 96(3): 438-450 (2021) - [j210]Luyi Li, Xueliang Li:
Digraphs with proper connection number two. Theor. Comput. Sci. 873: 64-75 (2021) - 2020
- [j209]Xueliang Li, Xiaoyu Zhu:
Conflict-free (vertex-)connection numbers of graphs with small diameters. Australas. J Comb. 76: 288-298 (2020) - [j208]Meng Ji, Xueliang Li:
Strong conflict-free connection of graphs. Appl. Math. Comput. 364 (2020) - [j207]Ran Gu, Xueliang Li:
Conflict-free connection number of random graphs. Discret. Appl. Math. 283: 522-532 (2020) - [j206]Xueliang Li, Yiyang Li, Jiarong Song:
The asymptotic value of graph energy for random graphs with degree-based weights. Discret. Appl. Math. 284: 481-488 (2020) - [j205]Ping Li, Xueliang Li:
Monochromatic k-edge-connection colorings of graphs. Discret. Math. 343(2): 111679 (2020) - [j204]Jiaao Li, Xueliang Li, Meiling Wang:
Complementary graphs with flows less than three. Discret. Math. 343(5): 111809 (2020) - [j203]Zhiwei Guo, Binlong Li, Xueliang Li, Shenggui Zhang:
Compatible spanning circuits in edge-colored graphs. Discret. Math. 343(7): 111908 (2020) - [j202]Zemin Jin, Xueliang Li, Yirong Yang:
Extremal graphs with maximum monochromatic connectivity. Discret. Math. 343(9): 111968 (2020) - [j201]Stanislav Jendrol', Xueliang Li, Yaping Mao, Yingying Zhang, Haixing Zhao, Xiaoyu Zhu:
Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40(1): 51-65 (2020) - [j200]Jiaao Li, Xueliang Li, Meiling Wang:
Spanning Triangle-Trees and Flows of Graphs. Graphs Comb. 36(6): 1797-1814 (2020) - [j199]Xuqing Bai, Hong Chang, Xueliang Li:
More on limited packings in graphs. J. Comb. Optim. 40(2): 412-430 (2020) - [j198]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): 1411 (2020) - [j197]Meng Ji, Xueliang Li, Xiaoyu Zhu:
(Strong) conflict-free connectivity: Algorithm and complexity. Theor. Comput. Sci. 804: 72-80 (2020) - [j196]Zhong Huang, Xueliang Li:
Hardness results for three kinds of colored connections of graphs. Theor. Comput. Sci. 841: 27-38 (2020) - [c11]You Chen, Ping Li, Xueliang Li, Yindi Weng:
Complexity Results for the Proper Disconnection of Graphs. FAW 2020: 1-12 - [i25]Zhong Huang, Xueliang Li:
Hardness results for three kinds of colored connections of graphs. CoRR abs/2001.01948 (2020) - [i24]Xuqing Bai, Xueliang Li:
Graph colorings under global structural conditions. CoRR abs/2008.07163 (2020) - [i23]Xuqing Bai, Xueliang Li:
Strong rainbow disconnection in graphs. CoRR abs/2009.02664 (2020)
2010 – 2019
- 2019
- [j195]Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao, Haixing Zhao:
On conflict-free connection of graphs. Discret. Appl. Math. 255: 167-182 (2019) - [j194]Hui Jiang, Xueliang Li, Yingying Zhang:
Erdős-Gallai-type results for total monochromatic connection of graphs. Discuss. Math. Graph Theory 39(4): 775-785 (2019) - [j193]Xueliang Li, Xiaoyu Zhu:
Kaleidoscopic edge-coloring of complete graphs and r-regular graphs. Discuss. Math. Graph Theory 39(4): 881-888 (2019) - [j192]Xueliang Li, Wen Xia:
Skew-rank of an oriented graph and independence number of its underlying graph. J. Comb. Optim. 38(1): 268-277 (2019) - [j191]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant:
Minimum degree condition for proper connection number 2. Theor. Comput. Sci. 774: 44-50 (2019) - [i22]You Chen, Ping Li, Xueliang Li, Yindi Weng:
Complexity results for the proper disconnection of graphs. CoRR abs/1912.10349 (2019) - 2018
- [j190]Xueliang Li, Yan Zhao:
On extremal graphs with exactly one Steiner tree connecting any k vertices. Australas. J Comb. 70: 1-11 (2018) - [j189]Lin Chen, Xueliang Li, Henry Liu, Jinfeng Liu:
On various (strong) rainbow connection numbers of graphs. Australas. J Comb. 70: 137-156 (2018) - [j188]Ran Gu, Xueliang Li, Zhongmei Qin, Yongtang Shi, Kang Yang:
Non-jumping numbers for 5-uniform hypergraphs. Appl. Math. Comput. 317: 234-251 (2018) - [j187]Hui Jiang, Xueliang Li, Yingying Zhang:
More on total monochromatic connection of graphs. Ars Comb. 136: 263-275 (2018) - [j186]Zhiwei Guo, Xueliang Li, Chuandong Xu, Shenggui Zhang:
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. Discret. Math. 341(7): 2104-2112 (2018) - [j185]Ivan Gutman, Xueliang Li, Yaping Mao:
Inverse problem on the Steiner Wiener index. Discuss. Math. Graph Theory 38(1): 83-95 (2018) - [j184]Wenjing Li, Xueliang Li, Jingshu Zhang:
Rainbow vertex-connection and forbidden subgraphs. Discuss. Math. Graph Theory 38(1): 143-154 (2018) - [j183]Xueliang Li, Colton Magnant, Meiqin Wei, Xiaoyu Zhu:
Generalized rainbow connection of graphs and their complements. Discuss. Math. Graph Theory 38(2): 371-384 (2018) - [j182]Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer:
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34(6): 1553-1563 (2018) - [j181]Qingqiong Cai, Xueliang Li, Di Wu:
Some extremal results on the colorful monochromatic vertex-connectivity of a graph. J. Comb. Optim. 35(4): 1300-1311 (2018) - [j180]Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin:
The (k , ℓ)-proper index of graphs. J. Comb. Optim. 36(2): 458-471 (2018) - [i21]Meng Ji, Xueliang Li, Xiaoyu Zhu:
Conflict-free connections: algorithm and complexity. CoRR abs/1805.08072 (2018) - [i20]Zhong Huang, Xueliang Li:
Hardness results for rainbow disconnection of graphs. CoRR abs/1811.11939 (2018) - 2017
- [j179]Wenjing Li, Xueliang Li, Jingshu Zhang:
The k-proper index of complete bipartite and complete multipartite graphs. Australas. J Comb. 68: 304-316 (2017) - [j178]Lin Chen, Xueliang Li, Jinfeng Liu:
The k-proper index of graphs. Appl. Math. Comput. 296: 57-63 (2017) - [j177]Wenjing Li, Xueliang Li, Di Wu:
Hardness result for the total rainbow k-connection of graphs. Appl. Math. Comput. 305: 27-31 (2017) - [j176]Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang:
The von Neumann entropy of random multipartite graphs. Discret. Appl. Math. 232: 201-206 (2017) - [j175]Hui Jiang, Xueliang Li, Yingying Zhang:
Total monochromatic connection of graphs. Discret. Math. 340(2): 175-180 (2017) - [j174]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki:
On two conjectures about the proper connection number of graphs. Discret. Math. 340(9): 2217-2222 (2017) - [j173]Xueliang Li, Hengzhe Li, Yuefang Sun:
Rainbow connection number of graphs with diameter 3. Discuss. Math. Graph Theory 37(1): 141-154 (2017) - [j172]Wenjing Li, Xueliang Li, Jingshu Zhang:
3-Rainbow Index and Forbidden Subgraphs. Graphs Comb. 33(4): 999-1008 (2017) - [j171]Qingqiong Cai, Xueliang Li, Di Wu:
Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. J. Comb. Optim. 33(1): 123-131 (2017) - [j170]Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao:
A solution to a conjecture on the generalized connectivity of graphs. J. Comb. Optim. 33(1): 275-282 (2017) - [j169]Yuefang Sun, Xueliang Li:
On the difference of two generalized connectivities of a graph. J. Comb. Optim. 33(1): 283-291 (2017) - [j168]Xueliang Li, Di Wu:
The (vertex-)monochromatic index of a graph. J. Comb. Optim. 33(4): 1443-1453 (2017) - [j167]Fei Huang, Xueliang Li, Shujing Wang:
Upper bounds of proper connection number of graphs. J. Comb. Optim. 34(1): 165-173 (2017) - [j166]Jiansheng Cai, Xueliang Li, Guiying Yan:
Improved upper bound for the degenerate and star chromatic numbers of graphs. J. Comb. Optim. 34(2): 441-452 (2017) - [c10]Bo Deng, Wenjing Li, Xueliang Li, Yaping Mao, Haixing Zhao:
Conflict-Free Connection Numbers of Line Graphs. COCOA (1) 2017: 141-151 - [i19]Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang:
Conflict-free connection of trees. CoRR abs/1712.10010 (2017) - 2016
- [j165]Qingqiong Cai, Xueliang Li, Yan Zhao:
Note on the upper bound of the rainbow index of a graph. Discret. Appl. Math. 209: 68-74 (2016) - [j164]Ivan Gutman, Xueliang Li, Yaping Mao:
The Steiner Wiener index of a graph. Discuss. Math. Graph Theory 36(2): 455-465 (2016) - [j163]Xueliang Li, Yaping Mao:
Graphs with large generalized (edge-)connectivity. Discuss. Math. Graph Theory 36(4): 931-958 (2016) - [j162]Jiuying Dong, Xueliang Li:
Rainbow Connection Number and Independence Number of a Graph. Graphs Comb. 32(5): 1829-1841 (2016) - [j161]Ran Gu, Xueliang Li, Yuejian Peng, Yongtang Shi:
Some Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 31(1): 223-238 (2016) - [j160]Qingqiong Cai, Xueliang Li, Yan Zhao:
The 3-rainbow index and connected dominating sets. J. Comb. Optim. 31(3): 1142-1159 (2016) - [j159]Hui Jiang, Xueliang Li, Yingying Zhang:
Upper bounds for the total rainbow connection of graphs. J. Comb. Optim. 32(1): 260-266 (2016) - [j158]Ruihu Li, Qiang Fu, Luobin Guo, Xueliang Li:
Construction of quantum caps in projective space PG(r, 4) and quantum codes of distance 4. Quantum Inf. Process. 15(2): 689-720 (2016) - [j157]Ran Gu, Xueliang Li, Zhongmei Qin:
Proper connection number of random graphs. Theor. Comput. Sci. 609: 336-343 (2016) - 2015
- [j156]Shasha Li, Xueliang Li, Yongtang Shi:
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. Appl. Math. Comput. 258: 155-161 (2015) - [j155]Xueliang Li, Zhongmei Qin, Meiqin Wei, Ivan Gutman, Matthias Dehmer:
Novel inequalities for generalized graph entropies - Graph energies and topological indices. Appl. Math. Comput. 259: 470-479 (2015) - [j154]Fei Huang, Xueliang Li, Shujing Wang:
On graphs with maximum Harary spectral radius. Appl. Math. Comput. 266: 937-945 (2015) - [j153]Xueliang Li, Yaping Mao:
The minimal size of a graph with given generalized 3-edge-connectivity. Ars Comb. 118: 63-72 (2015) - [j152]Xueliang Li, Jing Ma, Yongtang Shi, Jun Yue:
Note on a Turan-type problem on distances. Ars Comb. 119: 211-219 (2015) - [j151]Jiuying Dong, Xueliang Li:
An improved Fan-Type degree condition for k-linked graphs. Ars Comb. 121: 275-279 (2015) - [j150]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): 1 (2015) - [j149]Matthias Dehmer, Xueliang Li, Yongtang Shi:
Connections between generalized graph entropies and graph energy. Complex. 21(1): 35-41 (2015) - [j148]Xueliang Li, Yaping Mao:
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. Discret. Appl. Math. 185: 102-112 (2015) - [j147]Xiaolin Chen, Xueliang Li, Huishu Lian:
The matching energy of random graphs. Discret. Appl. Math. 193: 102-109 (2015) - [j146]Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue:
Note on the spanning-tree packing number of lexicographic product graphs. Discret. Math. 338(5): 669-673 (2015) - [j145]Lily Chen, Xueliang Li, Kang Yang, Yan Zhao:
The 3-rainbow index of a graph. Discuss. Math. Graph Theory 35(1): 81-94 (2015) - [j144]Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao:
Graphs with 3-rainbow index n-1 and n-2. Discuss. Math. Graph Theory 35(1): 105-120 (2015) - [j143]Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao:
Graphs with 4-rainbow index 3 and n-1. Discuss. Math. Graph Theory 35(2): 387-398 (2015) - [j142]Xueliang Li, Yongtang Shi, Martin Trinks:
Polynomial reconstruction of the matching polynomial. Electron. J. Graph Theory Appl. 3(1): 27-34 (2015) - [j141]Xueliang Li, Sujuan Liu:
Rainbow Connection Number and the Number of Blocks. Graphs Comb. 31(1): 141-147 (2015) - [j140]Xueliang Li, Yaping Mao:
On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. Graphs Comb. 31(6): 2231-2259 (2015) - [j139]Ruihu Li, Xueliang Li, Luobin Guo:
On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound. Quantum Inf. Process. 14(12): 4427-4447 (2015) - [j138]Xueliang Li, Meiqin Wei, Jun Yue:
Proper connection number and connected dominating sets. Theor. Comput. Sci. 607: 480-487 (2015) - [c9]Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li:
Searching for (near) Optimal Codes. COCOA 2015: 521-536 - [c8]Luobin Guo, Qiang Fu, Ruihu Li, Xueliang Li:
On shortening construction of self-orthogonal quaternary codes. IWSDA 2015: 99-102 - [i18]Xueliang Li, Meiqin Wei:
A survey of recent results in (generalized) graph entropies. CoRR abs/1505.04658 (2015) - 2014
- [j137]Xueliang Li, Yaping Mao, Yuefang Sun:
On the generalized (edge-)connectivity of graphs. Australas. J Comb. 58: 304-319 (2014) - [j136]Xueliang Li, Yuefang Sun, Yan Zhao:
Characterize graphs with rainbow connection numbers m-2 and m-3. Australas. J Comb. 60: 306-313 (2014) - [j135]Xiaolong Huang, Xueliang Li, Yongtang Shi, Jun Yue, Yan Zhao:
Rainbow connections for outerplanar graphs with diameter 2 and 3. Appl. Math. Comput. 242: 277-280 (2014) - [j134]Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun:
Note on the generalized connectivity. Ars Comb. 114: 193-202 (2014) - [j133]Xueliang Li, Sujuan Liu:
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs. Discret. Appl. Math. 173: 62-69 (2014) - [j132]Lily Chen, Xueliang Li, Mengmeng Liu:
Tricyclic graphs with maximal revised Szeged index. Discret. Appl. Math. 177: 71-79 (2014) - [j131]Xueliang Li, Yaping Mao:
The generalized 3-connectivity of Lexicographic product graphs. Discret. Math. Theor. Comput. Sci. 16(1): 339-354 (2014) - [j130]Xiaolong Huang, Hengzhe Li, Xueliang Li, Yuefang Sun:
Oriented diameter and rainbow connection number of a graph. Discret. Math. Theor. Comput. Sci. 16(3): 51-60 (2014) - [j129]Lily Chen, Xueliang Li, Mengmeng Liu:
The (revised) Szeged index and the Wiener index of a nonbipartite graph. Eur. J. Comb. 36: 237-246 (2014) - [j128]Hengzhe Li, Xueliang Li, Yuefang Sun, Yan Zhao:
Note on Minimally d-Rainbow Connected Graphs. Graphs Comb. 30(4): 949-955 (2014) - [c7]Xueliang Li, Jun Yue, Yan Zhao:
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs. COCOA 2014: 412-425 - [i17]Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei:
Formally self-dual linear binary codes from circulant graphs. CoRR abs/1402.6399 (2014) - [i16]Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei:
Additive codes over $GF(4)$ from circulant graphs. CoRR abs/1403.7933 (2014) - 2013
- [j127]A. Anuradha, R. Balakrishnan, Xiaolin Chen, Xueliang Li, Huishu Lian, Wasin So:
Skew Spectra of Oriented Bipartite Graphs. Electron. J. Comb. 20(4): 18 (2013) - [j126]Xueliang Li, Mengmeng Liu:
Bicyclic graphs with maximal revised Szeged index. Discret. Appl. Math. 161(16-17): 2527-2531 (2013) - [j125]Xueliang Li, Sujuan Liu:
A sharp upper bound for the rainbow 2-connection number of a 2-connected graph. Discret. Math. 313(6): 755-759 (2013) - [j124]Xueliang Li, Yongtang Shi:
On the rainbow vertex-connection. Discuss. Math. Graph Theory 33(2): 307-313 (2013) - [j123]Xueliang Li, Mengmeng Liu, Ingo Schiermeyer:
Rainbow connection number of dense graphs. Discuss. Math. Graph Theory 33(3): 603-611 (2013) - [j122]Xueliang Li, Yongtang Shi, Yuefang Sun:
Rainbow Connections of Graphs: A Survey. Graphs Comb. 29(1): 1-38 (2013) - [j121]Lily Chen, Xueliang Li, Huishu Lian:
Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs. Graphs Comb. 29(5): 1235-1247 (2013) - [j120]Xueliang Li, Yongtang Shi:
Rainbow Connection in 3-Connected Graphs. Graphs Comb. 29(5): 1471-1475 (2013) - [j119]Jiuying Dong, Xueliang Li:
Rainbow Connection Number, Bridges and Radius. Graphs Comb. 29(6): 1733-1739 (2013) - [j118]Qingqiong Cai, Xueliang Li, Jiangli Song:
Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs. Networks 62(3): 220-224 (2013) - [j117]Lily Chen, Xueliang Li, Huishu Lian:
Further hardness results on the rainbow vertex-connection number of graphs. Theor. Comput. Sci. 481: 18-23 (2013) - 2012
- [j116]Shasha Li, Wei Li, Xueliang Li:
The generalized connectivity of complete bipartite graphs. Ars Comb. 104: 65-79 (2012) - [j115]Xiaolin Chen, Xueliang Li:
A solution to a conjecture on two rainbow connection numbers of a graph. Ars Comb. 104: 193-196 (2012) - [j114]Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Rainbow Connection Number and Connectivity. Electron. J. Comb. 19(1): 20 (2012) - [j113]Hengzhe Li, Xueliang Li, Sujuan Liu:
Rainbow connection of graphs with diameter 2. Discret. Math. 312(8): 1453-1457 (2012) - [j112]Hengzhe Li, Xueliang Li, Yuefang Sun:
The generalized 3-connectivity of Cartesian product. Discret. Math. Theor. Comput. Sci. 14(1): 43-54 (2012) - [j111]Xueliang Li, Yuefang Sun:
Upper Bounds for the Rainbow Connection Numbers of Line Graphs. Graphs Comb. 28(2): 251-263 (2012) - [j110]Shasha Li, Xueliang Li:
Note on the hardness of generalized connectivity. J. Comb. Optim. 24(3): 389-396 (2012) - [i15]Xueliang Li, Yaping Mao:
A survey on the generalized connectivity of graphs. CoRR abs/1207.1838 (2012) - 2011
- [j109]Xueliang Li, Yiyang Li:
The asymptotic value of the Randić index for trees. Adv. Appl. Math. 47(2): 365-378 (2011) - [j108]Xueliang Li, Yuefang Sun:
On the rainbow k-connectivity of complete graphs. Australas. J Comb. 49: 217-226 (2011) - [j107]Shasha Li, Xueliang Li, Yongtang Shi:
The minimal size of a graph with generalized connectivity κ3 = 2. Australas. J Comb. 51: 209-220 (2011) - [j106]Xueliang Li, Yuefang Sun:
Rainbow connection numbers of line graphs. Ars Comb. 100: 449-463 (2011) - [j105]Xueliang Li, Yan Liu, Biao Zhao:
Isomorphisms of directed P3-graphs. Ars Comb. 101: 435-448 (2011) - [j104]Xueliang Li, Yongtang Shi:
On the diameter and inverse degree. Ars Comb. 101: 481-487 (2011) - [j103]Xueliang Li, Yuefang Sun:
Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs. Ars Comb. 101: 513-518 (2011) - [j102]Hengzhe Li, Xueliang Li, Sujuan Liu:
The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. Comput. Math. Appl. 62(11): 4082-4088 (2011) - [j101]Bofeng Huo, Xueliang Li, Yongtang Shi:
Complete solution to a conjecture on the maximal energy of unicyclic graphs. Eur. J. Comb. 32(5): 662-673 (2011) - [j100]Lei Li, Xueliang Li:
The covering values for acyclic digraph games. Int. J. Game Theory 40(4): 697-718 (2011) - [j99]Lily Chen, Xueliang Li, Yongtang Shi:
The complexity of determining the rainbow vertex-connection of a graph. Theor. Comput. Sci. 412(35): 4531-4535 (2011) - [i14]Lily Chen, Xueliang Li, Yongtang Shi:
The complexity of determining the rainbow vertex-connection of graphs. CoRR abs/1101.3126 (2011) - [i13]Xueliang Li, Yuefang Sun:
Rainbow Connection of Graphs -- A Survey. CoRR abs/1101.5747 (2011) - [i12]Shasha Li, Xueliang Li:
Note on the complexity of deciding the rainbow connectedness for bipartite graphs. CoRR abs/1109.5534 (2011) - [i11]Lily Chen, Xueliang Li, Huishu Lian:
Further hardness results on the rainbow vertex-connection number of graphs. CoRR abs/1110.1915 (2011) - [i10]Xiaolong Huang, Xueliang Li, Yongtang Shi:
Rainbow connections for planar graphs and line graphs. CoRR abs/1110.3147 (2011) - 2010
- [j98]Shasha Li, Xueliang Li, Wenli Zhou:
Sharp bounds for the generalized connectivity kappa3(G). Discret. Math. 310(15-16): 2147-2163 (2010) - [j97]Xueliang Li, Jianxi Liu, Lingping Zhong:
Trees with a given order and matching number that have maximum general Randic index. Discret. Math. 310(17-18): 2249-2257 (2010) - [j96]Xueliang Li, Yongtang Shi:
On a relation between the Randic index and the chromatic number. Discret. Math. 310(17-18): 2448-2451 (2010) - [j95]Xueliang Li, Bolian Liu, Jianxi Liu:
Complete solution to a conjecture on Randic index. Eur. J. Oper. Res. 200(1): 9-13 (2010) - [i9]Xueliang Li, Yiyang Li:
The asymptotic value of Randic index for trees. CoRR abs/1003.4810 (2010) - [i8]Xueliang Li, Yiyang Li:
The asymptotic values of the general Zagreb and Randić indices of trees with bounded maximum degree. CoRR abs/1004.1778 (2010) - [i7]Xueliang Li, Yuefang Sun:
Note on the Rainbow $k$-Connectivity of Regular Complete Bipartite Graphs. CoRR abs/1004.2312 (2010) - [i6]Shasha Li, Xueliang Li:
Hardness results on generalized connectivity. CoRR abs/1005.0488 (2010)
2000 – 2009
- 2009
- [j94]Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma:
Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009) - [j93]Xueliang Li, Zhixia Xu:
The rainbow number of matchings in regular bipartite graphs. Appl. Math. Lett. 22(10): 1525-1528 (2009) - [j92]Hao Li, Xueliang Li, Guizhen Liu, Guanghui Wang:
The heterochromatic matchings in edge-colored bipartite graphs. Ars Comb. 93 (2009) - [j91]Zemin Jin, Xueliang Li:
Anti-Ramsey Numbers for Graphs with Independent Cycles. Electron. J. Comb. 16(1) (2009) - [j90]Xueliang Li, Jianbin Zhang, Lusheng Wang:
On bipartite graphs with minimal energy. Discret. Appl. Math. 157(4): 869-873 (2009) - [j89]Xueliang Li, Jianxi Liu:
A proof of a conjecture on the Randic index of graphs with given girth. Discret. Appl. Math. 157(15): 3332-3335 (2009) - [j88]Xueliang Li, Jianhua Tu, Zemin Jin:
Bipartite rainbow numbers of matchings. Discret. Math. 309(8): 2575-2578 (2009) - [j87]He Chen, Xueliang Li, Jianhua Tu:
Complete solution for the rainbow numbers of matchings. Discret. Math. 309(10): 3370-3380 (2009) - [j86]Xueliang Li, Jianxi Liu:
Complete solution to a conjecture on the Randic index of triangle-free graphs. Discret. Math. 309(21): 6322-6324 (2009) - [c6]Xueliang Li, Yang Luo:
Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary. CSIE (3) 2009: 369-374 - [i5]Xueliang Li, Yuefang Sun:
The rainbow k-connectivity of two classes of graphs. CoRR abs/0906.3946 (2009) - 2008
- [j85]Xueliang Li, Yan Liu:
Nonexistence of Triples of Nonisomorphic Connected Graphs with Isomorphic Connected P3-graphs. Electron. J. Comb. 15(1) (2008) - [j84]Xueliang Li, Fengxia Liu:
Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition. Electron. J. Comb. 15(1) (2008) - [j83]Xueliang Li, Chao Wang, Xiaoyan Zhang:
The general sigma all-ones problem for trees. Discret. Appl. Math. 156(10): 1790-1801 (2008) - [j82]Xueliang Li, Jianhua Tu:
NP-completeness of 4-incidence colorability of semi-cubic graphs. Discret. Math. 308(7): 1334-1340 (2008) - [j81]Ruihu Li, Xueliang Li:
Binary construction of quantum codes of minimum distances five and six. Discret. Math. 308(9): 1603-1611 (2008) - [j80]He Chen, Zemin Jin, Xueliang Li, Jianhua Tu:
Heterochromatic tree partition numbers for complete bipartite graphs. Discret. Math. 308(17): 3871-3878 (2008) - [j79]Zemin Jin, Xueliang Li:
Graphs with the second largest number of maximal independent sets. Discret. Math. 308(23): 5864-5870 (2008) - [j78]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Some families of integral graphs. Discret. Math. 308(24): 6383-6391 (2008) - [j77]Mikio Kano, Xueliang Li:
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Graphs Comb. 24(4): 237-263 (2008) - [j76]Xueliang Li, Yan Liu:
On the Determination Problem for P 4-Transformation of Graphs. Graphs Comb. 24(6): 551-562 (2008) - [j75]Xueliang Li, Wenli Zhou:
The 2nd-order conditional 3-coloring of claw-free graphs. Theor. Comput. Sci. 396(1-3): 151-157 (2008) - [j74]Ruihu Li, Zongben Xu, Xueliang Li:
Standard Forms of Stabilizer and Normalizer Matrices for Additive Quantum Codes. IEEE Trans. Inf. Theory 54(8): 3775-3778 (2008) - 2007
- [j73]Haixing Zhao, Xueliang Li, Ruying Liu:
Chromaticity of the Complements of Some Sparse Graphs. Australas. J Comb. 37: 11-20 (2007) - [j72]Fengwei Li, Xueliang Li:
The neighbour-scattering number can be computed in polynomial time for interval graphs. Comput. Math. Appl. 54(5): 679-686 (2007) - [j71]He Chen, Xueliang Li:
Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs. Electron. J. Comb. 14(1) (2007) - [j70]Yumei Hu, Xueliang Li, Yongtang Shi, Tianyi Xu:
Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index. Discret. Appl. Math. 155(8): 1044-1054 (2007) - [j69]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6. Discret. Appl. Math. 155(10): 1254-1266 (2007) - [j68]Xueliang Li, Yongtang Shi:
Corrections of proofs for Hansen and Mélot's two theorems. Discret. Appl. Math. 155(17): 2365-2370 (2007) - [j67]Xueliang Li, Xiaoyan Zhang:
On the minimum monochromatic or multicolored subgraph partition problems. Theor. Comput. Sci. 385(1-3): 1-10 (2007) - [j66]Hajo Broersma, Xueliang Li:
On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007) - [e1]Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu:
Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers. Lecture Notes in Computer Science 4381, Springer 2007, ISBN 978-3-540-70665-6 [contents] - [i4]Xueliang Li, Xiangmei Yao, Wenli Zhou:
Complexity of the conditional colorability of graphs. CoRR abs/0711.2843 (2007) - [i3]Xueliang Li, Wenli Zhou:
Dynamic 3-Coloring of Claw-free Graphs. CoRR abs/0711.2844 (2007) - 2006
- [j65]Xueliang Li, Zhao Zhang:
A Characterization of Graphs without Even Factors. Graphs Comb. 22(4): 497-502 (2006) - [j64]Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei:
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11(4): 445-454 (2006) - [j63]Zemin Jin, Xueliang Li:
On the k-path cover problem for cacti. Theor. Comput. Sci. 355(3): 354-363 (2006) - [i2]Fengwei Li, Xueliang Li:
The neighbor-scattering number can be computed in polynomial time for interval graphs. CoRR abs/cs/0603069 (2006) - [i1]Xueliang Li, Jianhua Tu:
NP-completeness of 4-incidence colorability of semi-cubic graphs. CoRR abs/math/0607071 (2006) - 2005
- [j62]Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. Australas. J Comb. 31: 299-312 (2005) - [j61]William Y. C. Chen, Xueliang Li, Jie Zheng:
Matrix method for linear sequential dynamical systems on digraphs. Appl. Math. Comput. 160(1): 197-212 (2005) - [j60]Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph. Ars Comb. 75 (2005) - [j59]Ligong Wang, Xueliang Li, Cornelis Hoede:
Two Classes of Integral Regular Graphs. Ars Comb. 76 (2005) - [j58]He Chen, Xueliang Li:
Long Heterochromatic Paths in Edge-Colored Graphs. Electron. J. Comb. 12 (2005) - [j57]Haixing Zhao, Xueliang Li, Ruying Liu:
On problems and conjectures on adjointly equivalent graphs. Discret. Math. 295(1-3): 203-212 (2005) - [j56]Ligong Wang, Xueliang Li:
Integral trees with diameters 5 and 6. Discret. Math. 297(1-3): 128-143 (2005) - [j55]Yinkui Li, Shenggui Zhang, Xueliang Li:
Rupture degree of graphs. Int. J. Comput. Math. 82(7): 793-803 (2005) - [j54]Xueliang Li, Wenan Zang:
A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. J. Comb. Optim. 9(4): 331-347 (2005) - [c5]Lin Hu, Xueliang Li:
Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs. CJCDGCGT 2005: 47-58 - [c4]Genjiu Xu, Xueliang Li, Shenggui Zhang:
The Binding Number of a Digraph. CJCDGCGT 2005: 221-227 - [c3]Fengwei Li, Xueliang Li:
Computational complexity and bounds for neighbor-scattering number of graphs. ISPAN 2005: 478-483 - 2004
- [j53]Zemin Jin, Xueliang Li:
On a conjecture on k-walks of graphs. Australas. J Comb. 29: 135-142 (2004) - [j52]Haixing Zhao, Ruying Liu, Xueliang Li, Ligong Wang:
On properties of adjoint polynomials of graphs and their applications. Australas. J Comb. 30: 291-306 (2004) - [j51]Ligong Wang, Xueliang Li, Shenggui Zhang:
Families of integral trees with diameters 4, 6, and 8. Discret. Appl. Math. 136(2-3): 349-362 (2004) - [j50]Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu:
On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. Discret. Math. 281(1-3): 277-294 (2004) - [j49]Ligong Wang, Xueliang Li, Cornelis Hoede:
Integral complete r-partite graphs. Discret. Math. 283(1-3): 231-241 (2004) - [j48]Liming Xiong, Hajo Broersma, Xueliang Li, Mingchu Li:
The hamiltonian index of a graph and its branch-bonds. Discret. Math. 285(1-3): 279-288 (2004) - [j47]Jichang Wu, Xueliang Li, Lusheng Wang:
Removable edges in a cycle of a 4-connected graph. Discret. Math. 287(1-3): 103-111 (2004) - [j46]Xueliang Li, Biao Zhao:
Isomorphisms of Pk-graphs for kge4. Discret. Math. 289(1-3): 71-80 (2004) - [j45]William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang:
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs. Electron. Notes Discret. Math. 17: 93-98 (2004) - [j44]Jichang Wu, Xueliang Li:
Removable Edges in Longest Cycles of 4-Connected Graphs. Graphs Comb. 20(3): 413-422 (2004) - [j43]Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye:
The Chromaticity of Certain Complete Multipartite Graphs. Graphs Comb. 20(3): 423-434 (2004) - [j42]Zemin Jin, Xueliang Li:
The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math. 81(11): 1357-1362 (2004) - [j41]Jichang Wu, Xueliang Li, Jianji Su:
The number of removable edges in a 4-connected graph. J. Comb. Theory B 92(1): 13-40 (2004) - [j40]William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang:
The Minimum All-Ones Problem for Trees. SIAM J. Comput. 33(2): 379-392 (2004) - [j39]Ruihu Li, Xueliang Li:
Binary Construction of Quantum Codes of Minimum Distance Three and Four. IEEE Trans. Inf. Theory 50(6): 1331-1336 (2004) - [c2]William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang:
Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs. CTW 2004: 86-90 - [c1]Fengwei Li, Xueliang Li:
Computing the Rupture Degrees of Graphs. ISPAN 2004: 368-373 - 2003
- [j38]Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
On a tree graph defined by a set of cycles. Discret. Math. 271(1-3): 303-310 (2003) - [j37]Xueliang Li, Zimao Li, Lusheng Wang:
The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. J. Comput. Biol. 10(1): 47-55 (2003) - [j36]Xueliang Li, Lusheng Wang:
Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids. SIAM J. Discret. Math. 17(2): 210-218 (2003) - 2002
- [j35]Ligong Wang, Xueliang Li, Xiangjuan Yao:
Integral trees with diameters 4, 6 and 8. Australas. J Comb. 25: 29-44 (2002) - [j34]Hajo Broersma, Xueliang Li:
Some approaches to a conjecture on short cycles in digraphs. Discret. Appl. Math. 120(1-3): 45-53 (2002) - [j33]Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li:
Degree sums and subpancyclicity in line graphs. Discret. Math. 242(1-3): 255-267 (2002) - [j32]Hajo Broersma, Xueliang Li:
Isomorphisms and traversability of directed path graphs. Discuss. Math. Graph Theory 22(2): 215-228 (2002) - [j31]Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang:
A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs Comb. 18(1): 193-200 (2002) - [j30]Shenggui Zhang, Xueliang Li, Xinglou Han:
Computing the Scattering Number of Graphs. Int. J. Comput. Math. 79(2): 179-187 (2002) - 2001
- [j29]Hajo Broersma, Xueliang Li, Shenggui Zhang:
A σ3 type condition for heavy cycles in weighted graphs. Discuss. Math. Graph Theory 21(2): 159-166 (2001) - [j28]Ligong Wang, Xueliang Li, Shenggui Zhang:
Some New Families of Integral Trees with Diameters 4 and 6. Electron. Notes Discret. Math. 8: 119-123 (2001) - [j27]Xueliang Li, Shenggui Zhang, Hajo Broersma:
Paths and Cycles in Colored Graphs. Electron. Notes Discret. Math. 8: 128-132 (2001) - [j26]Hao Sun, Shenggui Zhang, Xueliang Li, Theo S. H. Driessen, Cornelis Hoede:
A Co-Marginalistic Contribution Value for Set Games. IGTR 3(4): 351-362 (2001) - 2000
- [j25]Ligong Wang, Xueliang Li:
Some new classes of integral trees with diameters 4 and 6. Australas. J Comb. 21: 237-244 (2000) - [j24]Shenggui Zhang, Xueliang Li, Hajo Broersma:
Heavy paths and cycles in weighted graphs. Discret. Math. 223(1-3): 327-336 (2000)
1990 – 1999
- 1999
- [j23]Ligong Wang, Xueliang Li, Ruying Liu:
Integral Trees With Diameter 6 or 8. Electron. Notes Discret. Math. 3: 208-213 (1999) - 1998
- [j22]Xueliang Li:
On the Determination Problem for P3-Transformation of Graphs. Ars Comb. 49 (1998) - [j21]Hortensia Galeana-Sánchez, Xueliang Li:
Kernels in a special class of digraphs. Discret. Math. 178(1-3): 73-80 (1998) - [j20]Xueliang Li:
The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph. Discret. Math. 183(1-3): 237-245 (1998) - [j19]Xueliang Li:
Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem. Discret. Math. 188(1-3): 175-182 (1998) - [j18]Hortensia Galeana-Sánchez, Xueliang Li:
Semikernels and (k, l)-Kernels in Digraphs. SIAM J. Discret. Math. 11(2): 340-346 (1998) - 1997
- [j17]Xueliang Li, Biao Zhao:
Isomorphisms of P4-graphs. Australas. J Comb. 15: 135-144 (1997) - [j16]Xueliang Li:
Hexagonal Systems with Forcing Single Edges. Discret. Appl. Math. 72(3): 295-301 (1997) - [j15]Xueliang Li:
A lower bound for the connectivity of directed Euler tour transformation graphs. Discret. Math. 163(1-3): 101-108 (1997) - [j14]Hajo Broersma, Xueliang Li:
Spanning trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17(2): 259-269 (1997) - 1996
- [j13]Xueliang Li:
On a conjecture of Merrifield and Simmons. Australas. J Comb. 14: 15-20 (1996) - [j12]Hajo Broersma, Xueliang Li:
The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43 (1996) - [j11]Xueliang Li, Heping Zhang:
A solution to Gutman's problem on the characteristic polynomial of a bipartite graph. Discret. Math. 154(1-3): 297-300 (1996) - [j10]Xueliang Li:
Isomorphisms of P3-graphs. J. Graph Theory 21(1): 81-85 (1996) - 1995
- [j9]Xueliang Li, Ivan Gutman:
A Unified Approach to the First Derivatives of Graph Polynomials. Discret. Appl. Math. 58(3): 293-297 (1995) - [j8]Fuji Zhang, Xueliang Li:
Hexagonal systems with forcing edges. Discret. Math. 140(1-3): 253-263 (1995) - 1994
- [j7]Xueliang Li, Fuji Zhang:
Hamiltonicity of a Type of Interchange Graphs. Discret. Appl. Math. 51(1-2): 107-111 (1994) - [j6]Cornelis Hoede, Xueliang Li:
Clique polynomials and independent set polynomials of graphs. Discret. Math. 125(1-3): 219-228 (1994) - [j5]Xueliang Li, Fuji Zhang:
n-Dimensional line graphs. Discret. Math. 132(1-3): 127-135 (1994) - 1993
- [j4]Hajo Broersma, Xueliang Li:
On "The Matching Polynomial of a Polygraph". Discret. Appl. Math. 46(1): 79-86 (1993) - [j3]Fuji Zhang, Xueliang Li, Heping Zhang:
Hexagonal Systems with Fixed Bonds. Discret. Appl. Math. 47(3): 285-296 (1993) - 1992
- [j2]Haitze J. Broersma, Xueliang Li:
The connectivity of the basis graph of a branching greedoid. J. Graph Theory 16(3): 233-237 (1992) - 1991
- [j1]Xueliang Li, Fuji Zhang:
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs. Discret. Math. 94(3): 189-197 (1991)
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-10-30 21:34 CET 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:
