On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs. - Xueliang Li 001; Fuji Zhang (Discret. Math., 1991)

The connectivity of the basis graph of a branching greedoid. - Haitze J. Broersma; Xueliang Li 001 (J. Graph Theory, 1992)

On "The Matching Polynomial of a Polygraph". - Hajo Broersma; Xueliang Li 001 (Discret. Appl. Math., 1993)

Hexagonal Systems with Fixed Bonds. - Fuji Zhang; Xueliang Li 001; Heping Zhang (Discret. Appl. Math., 1993)

Hamiltonicity of a Type of Interchange Graphs. - Xueliang Li 001; Fuji Zhang (Discret. Appl. Math., 1994)

Clique polynomials and independent set polynomials of graphs. - Cornelis Hoede; Xueliang Li 001 (Discret. Math., 1994)

n-Dimensional line graphs. - Xueliang Li 001; Fuji Zhang (Discret. Math., 1994)

A Unified Approach to the First Derivatives of Graph Polynomials. - Xueliang Li 001; Ivan Gutman (Discret. Appl. Math., 1995)

Hexagonal systems with forcing edges. - Fuji Zhang; Xueliang Li 001 (Discret. Math., 1995)

On a conjecture of Merrifield and Simmons. - Xueliang Li 001 (Australas. J Comb., 1996)

The connectivity of the leaf-exchange spanning tree graph of a graph. - Hajo Broersma; Xueliang Li 001 (Ars Comb., 1996)

A solution to Gutman's problem on the characteristic polynomial of a bipartite graph. - Xueliang Li 001; Heping Zhang (Discret. Math., 1996)

Isomorphisms of P3-graphs. - Xueliang Li 001 (J. Graph Theory, 1996)

Isomorphisms of P4-graphs. - Xueliang Li 001; Biao Zhao (Australas. J Comb., 1997)

Hexagonal Systems with Forcing Single Edges. - Xueliang Li 001 (Discret. Appl. Math., 1997)

A lower bound for the connectivity of directed Euler tour transformation graphs. - Xueliang Li 001 (Discret. Math., 1997)

Spanning trees with many or few colors in edge-colored graphs. - Hajo Broersma; Xueliang Li 001 (Discuss. Math. Graph Theory, 1997)

On the Determination Problem for P3-Transformation of Graphs. - Xueliang Li 001 (Ars Comb., 1998)

Kernels in a special class of digraphs. - Hortensia Galeana-Sánchez; Xueliang Li 001 (Discret. Math., 1998)

The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph. - Xueliang Li 001 (Discret. Math., 1998)

Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem. - Xueliang Li 001 (Discret. Math., 1998)

Semikernels and (k, l)-Kernels in Digraphs. - Hortensia Galeana-Sánchez; Xueliang Li 001 (SIAM J. Discret. Math., 1998)

Integral Trees With Diameter 6 or 8. - Ligong Wang 001; Xueliang Li 001; Ruying Liu (Electron. Notes Discret. Math., 1999)

Some new classes of integral trees with diameters 4 and 6. - Ligong Wang 001; Xueliang Li 001 (Australas. J Comb., 2000)

Heavy paths and cycles in weighted graphs. - Shenggui Zhang; Xueliang Li 001; Hajo Broersma (Discret. Math., 2000)

A σ3 type condition for heavy cycles in weighted graphs. - Hajo Broersma; Xueliang Li 001; Shenggui Zhang (Discuss. Math. Graph Theory, 2001)

Paths and Cycles in Colored Graphs. - Xueliang Li 001; Shenggui Zhang; Hajo Broersma (Electron. Notes Discret. Math., 2001)

Some New Families of Integral Trees with Diameters 4 and 6. - Ligong Wang 001; Xueliang Li 001; Shenggui Zhang (Electron. Notes Discret. Math., 2001)

A Co-Marginalistic Contribution Value for Set Games. - Hao Sun 011; Shenggui Zhang; Xueliang Li 001; Theo S. H. Driessen; Cornelis Hoede (IGTR, 2001)

Integral trees with diameters 4, 6 and 8. - Ligong Wang 001; Xueliang Li 001; Xiangjuan Yao (Australas. J Comb., 2002)

Some approaches to a conjecture on short cycles in digraphs. - Hajo Broersma; Xueliang Li 001 (Discret. Appl. Math., 2002)

Degree sums and subpancyclicity in line graphs. - Liming Xiong; Hajo Broersma; Cornelis Hoede; Xueliang Li 001 (Discret. Math., 2002)

Isomorphisms and traversability of directed path graphs. - Hajo Broersma; Xueliang Li 001 (Discuss. Math. Graph Theory, 2002)

A Fan Type Condition For Heavy Cycles in Weighted Graphs. - Shenggui Zhang; Hajo Broersma; Xueliang Li 001; Ligong Wang 001 (Graphs Comb., 2002)

Computing the Scattering Number of Graphs. - Shenggui Zhang; Xueliang Li 001; Xinglou Han (Int. J. Comput. Math., 2002)

On a tree graph defined by a set of cycles. - Xueliang Li 001; Victor Neumann-Lara; Eduardo Rivera-Campo (Discret. Math., 2003)

The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. - Xueliang Li 001; Zimao Li; Lusheng Wang 001 (J. Comput. Biol., 2003)

Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids. - Xueliang Li 001; Lusheng Wang 001 (SIAM J. Discret. Math., 2003)

Computing the Rupture Degrees of Graphs. - Fengwei Li; Xueliang Li 001 (ISPAN, 2004)

On a conjecture on k-walks of graphs. - Zemin Jin; Xueliang Li 001 (Australas. J Comb., 2004)

On properties of adjoint polynomials of graphs and their applications. - Haixing Zhao; Ruying Liu; Xueliang Li 001; Ligong Wang 001 (Australas. J Comb., 2004)

Families of integral trees with diameters 4, 6, and 8. - Ligong Wang 001; Xueliang Li 001; Shenggui Zhang (Discret. Appl. Math., 2004)

Isomorphisms of Pk-graphs for kge4. - Xueliang Li 001; Biao Zhao (Discret. Math., 2004)

Integral complete r-partite graphs. - Ligong Wang 001; Xueliang Li 001; Cornelis Hoede (Discret. Math., 2004)

Removable edges in a cycle of a 4-connected graph. - Jichang Wu; Xueliang Li 001; Lusheng Wang 001 (Discret. Math., 2004)

The hamiltonian index of a graph and its branch-bonds. - Liming Xiong; Hajo Broersma; Xueliang Li 001; Mingchu Li (Discret. Math., 2004)

On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. - Haixing Zhao; Xueliang Li 001; Shenggui Zhang; Ruying Liu (Discret. Math., 2004)

Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs. - William Y. C. Chen; Xueliang Li 001; Chao Wang 020; Xiaoyan Zhang 001 (Electron. Notes Discret. Math., 2004)

Removable Edges in Longest Cycles of 4-Connected Graphs. - Jichang Wu; Xueliang Li 001 (Graphs Comb., 2004)

The Chromaticity of Certain Complete Multipartite Graphs. - Haixing Zhao; Xueliang Li 001; Ruying Liu; Chengfu Ye (Graphs Comb., 2004)

The complexity for partitioning graphs by monochromatic trees, cycles and paths. - Zemin Jin; Xueliang Li 001 (Int. J. Comput. Math., 2004)

The number of removable edges in a 4-connected graph. - Jichang Wu; Xueliang Li 001; Jianji Su (J. Comb. Theory B, 2004)

The Minimum All-Ones Problem for Trees. - William Y. C. Chen; Xueliang Li 001; Chao Wang 020; Xiaoyan Zhang 001 (SIAM J. Comput., 2004)

Binary Construction of Quantum Codes of Minimum Distance Three and Four. - Ruihu Li; Xueliang Li 001 (IEEE Trans. Inf. Theory, 2004)

Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs. - Lin Hu; Xueliang Li 001 (CJCDGCGT, 2005)

The Binding Number of a Digraph. - Genjiu Xu; Xueliang Li 001; Shenggui Zhang (CJCDGCGT, 2005)

Computational complexity and bounds for neighbor-scattering number of graphs. - Fengwei Li; Xueliang Li 001 (ISPAN, 2005)

Paths and cycles in colored graphs. - Hajo Broersma; Xueliang Li 001; Gerhard J. Woeginger; Shenggui Zhang (Australas. J Comb., 2005)

Matrix method for linear sequential dynamical systems on digraphs. - William Y. C. Chen; Xueliang Li 001; Jie Zheng (Appl. Math. Comput., 2005)

Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph. - Xueliang Li 001; Victor Neumann-Lara; Eduardo Rivera-Campo (Ars Comb., 2005)

Two Classes of Integral Regular Graphs. - Ligong Wang 001; Xueliang Li 001; Cornelis Hoede (Ars Comb., 2005)

Long Heterochromatic Paths in Edge-Colored Graphs. - He Chen 002; Xueliang Li 001 (Electron. J. Comb., 2005)

Integral trees with diameters 5 and 6. - Ligong Wang 001; Xueliang Li 001 (Discret. Math., 2005)

On problems and conjectures on adjointly equivalent graphs. - Haixing Zhao; Xueliang Li 001; Ruying Liu (Discret. Math., 2005)

Rupture degree of graphs. - Yinkui Li; Shenggui Zhang; Xueliang Li 001 (Int. J. Comput. Math., 2005)

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. - Xueliang Li 001; Wenan Zang (J. Comb. Optim., 2005)

The neighbor-scattering number can be computed in polynomial time for interval graphs - Fengwei Li; Xueliang Li 001 (CoRR, 2006)

A Characterization of Graphs without Even Factors. - Xueliang Li 001; Zhao Zhang (Graphs Comb., 2006)

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. - Zemin Jin; Mikio Kano; Xueliang Li 001; Bing Wei 001 (J. Comb. Optim., 2006)

On the k-path cover problem for cacti. - Zemin Jin; Xueliang Li 001 (Theor. Comput. Sci., 2006)

Chromaticity of the Complements of Some Sparse Graphs. - Haixing Zhao; Xueliang Li 001; Ruying Liu (Australas. J Comb., 2007)

The neighbour-scattering number can be computed in polynomial time for interval graphs. - Fengwei Li; Xueliang Li 001 (Comput. Math. Appl., 2007)

Color Neighborhood Union Conditions for Long Heterochromatic Paths in Edge-Colored Graphs. - He Chen 002; Xueliang Li 001 (Electron. J. Comb., 2007)

Complexity of the conditional colorability of graphs - Xueliang Li 001; Xiangmei Yao; Wenli Zhou (CoRR, 2007)

Dynamic 3-Coloring of Claw-free Graphs - Xueliang Li 001; Wenli Zhou (CoRR, 2007)

Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index. - Yumei Hu; Xueliang Li 001; Yongtang Shi; Tianyi Xu (Discret. Appl. Math., 2007)

Corrections of proofs for Hansen and Mélot's two theorems. - Xueliang Li 001; Yongtang Shi (Discret. Appl. Math., 2007)

Integral trees of diameter 6. - Ligong Wang 001; Hajo Broersma; Cornelis Hoede; Xueliang Li 001; Georg Still (Discret. Appl. Math., 2007)

On the complexity of dominating set problems related to the minimum all-ones problem. - Hajo Broersma; Xueliang Li 001 (Theor. Comput. Sci., 2007)

On the minimum monochromatic or multicolored subgraph partition problems. - Xueliang Li 001; Xiaoyan Zhang 001 (Theor. Comput. Sci., 2007)

Nonexistence of Triples of Nonisomorphic Connected Graphs with Isomorphic Connected P3-graphs. - Xueliang Li 001; Yan Liu (Electron. J. Comb., 2008)

Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition. - Xueliang Li 001; Fengxia Liu (Electron. J. Comb., 2008)

The general sigma all-ones problem for trees. - Xueliang Li 001; Chao Wang 020; Xiaoyan Zhang 001 (Discret. Appl. Math., 2008)

Heterochromatic tree partition numbers for complete bipartite graphs. - He Chen 002; Zemin Jin; Xueliang Li 001; Jianhua Tu (Discret. Math., 2008)

Graphs with the second largest number of maximal independent sets. - Zemin Jin; Xueliang Li 001 (Discret. Math., 2008)

Binary construction of quantum codes of minimum distances five and six. - Ruihu Li; Xueliang Li 001 (Discret. Math., 2008)

NP-completeness of 4-incidence colorability of semi-cubic graphs. - Xueliang Li 001; Jianhua Tu (Discret. Math., 2008)

Some families of integral graphs. - Ligong Wang 001; Hajo Broersma; Cornelis Hoede; Xueliang Li 001; Georg Still (Discret. Math., 2008)

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. - Mikio Kano; Xueliang Li 001 (Graphs Comb., 2008)

On the Determination Problem for P 4-Transformation of Graphs. - Xueliang Li 001; Yan Liu (Graphs Comb., 2008)

The 2nd-order conditional 3-coloring of claw-free graphs. - Xueliang Li 001; Wenli Zhou (Theor. Comput. Sci., 2008)

Standard Forms of Stabilizer and Normalizer Matrices for Additive Quantum Codes. - Ruihu Li; Zongben Xu; Xueliang Li 001 (IEEE Trans. Inf. Theory, 2008)

Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary. - Xueliang Li 001; Yang Luo (CSIE (3), 2009)

The rainbow number of matchings in regular bipartite graphs. - Xueliang Li 001; Zhixia Xu (Appl. Math. Lett., 2009)

Complexity of conditional colorability of graphs. - Xueliang Li 001; Xiangmei Yao; Wenli Zhou; Hajo Broersma (Appl. Math. Lett., 2009)

The heterochromatic matchings in edge-colored bipartite graphs. - Hao Li 002; Xueliang Li 001; Guizhen Liu; Guanghui Wang 002 (Ars Comb., 2009)

Anti-Ramsey Numbers for Graphs with Independent Cycles. - Zemin Jin; Xueliang Li 001 (Electron. J. Comb., 2009)

The rainbow k-connectivity of two classes of graphs - Xueliang Li 001; Yuefang Sun (CoRR, 2009)

A proof of a conjecture on the Randic index of graphs with given girth. - Xueliang Li 001; Jianxi Liu (Discret. Appl. Math., 2009)

On bipartite graphs with minimal energy. - Xueliang Li 001; Jianbin Zhang; Lusheng Wang 001 (Discret. Appl. Math., 2009)

Complete solution for the rainbow numbers of matchings. - He Chen 002; Xueliang Li 001; Jianhua Tu (Discret. Math., 2009)

Complete solution to a conjecture on the Randic index of triangle-free graphs. - Xueliang Li 001; Jianxi Liu (Discret. Math., 2009)

Bipartite rainbow numbers of matchings. - Xueliang Li 001; Jianhua Tu; Zemin Jin (Discret. Math., 2009)

The asymptotic values of the general Zagreb and Randić indices of trees with bounded maximum degree - Xueliang Li 001; Yiyang Li 007 (CoRR, 2010)

Hardness results on generalized connectivity - Shasha Li; Xueliang Li 001 (CoRR, 2010)

Sharp bounds for the generalized connectivity kappa3(G). - Shasha Li; Xueliang Li 001; Wenli Zhou (Discret. Math., 2010)

Trees with a given order and matching number that have maximum general Randic index. - Xueliang Li 001; Jianxi Liu; Lingping Zhong (Discret. Math., 2010)

On a relation between the Randic index and the chromatic number. - Xueliang Li 001; Yongtang Shi (Discret. Math., 2010)

Complete solution to a conjecture on Randic index. - Xueliang Li 001; Bolian Liu; Jianxi Liu (Eur. J. Oper. Res., 2010)

The asymptotic value of the Randić index for trees. - Xueliang Li 001; Yiyang Li 007 (Adv. Appl. Math., 2011)

The minimal size of a graph with generalized connectivity κ3 = 2. - Shasha Li; Xueliang Li 001; Yongtang Shi (Australas. J Comb., 2011)

On the rainbow k-connectivity of complete graphs. - Xueliang Li 001; Yuefang Sun (Australas. J Comb., 2011)

Isomorphisms of directed P3-graphs. - Xueliang Li 001; Yan Liu; Biao Zhao (Ars Comb., 2011)

Rainbow connection numbers of line graphs. - Xueliang Li 001; Yuefang Sun (Ars Comb., 2011)

On the diameter and inverse degree. - Xueliang Li 001; Yongtang Shi (Ars Comb., 2011)

Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs. - Xueliang Li 001; Yuefang Sun (Ars Comb., 2011)

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups. - Hengzhe Li; Xueliang Li 001; Sujuan Liu (Comput. Math. Appl., 2011)

The complexity of determining the rainbow vertex-connection of graphs - Lily Chen; Xueliang Li 001; Yongtang Shi (CoRR, 2011)

Rainbow Connection of Graphs – A Survey - Xueliang Li 001; Yuefang Sun (CoRR, 2011)

Note on the complexity of deciding the rainbow connectedness for bipartite graphs - Shasha Li; Xueliang Li 001 (CoRR, 2011)

Rainbow connections for planar graphs and line graphs - Xiaolong Huang; Xueliang Li 001; Yongtang Shi (CoRR, 2011)

Complete solution to a conjecture on the maximal energy of unicyclic graphs. - Bofeng Huo; Xueliang Li 001; Yongtang Shi (Eur. J. Comb., 2011)

The covering values for acyclic digraph games. - Lei Li; Xueliang Li 001 (Int. J. Game Theory, 2011)

The complexity of determining the rainbow vertex-connection of a graph. - Lily Chen; Xueliang Li 001; Yongtang Shi (Theor. Comput. Sci., 2011)

A solution to a conjecture on two rainbow connection numbers of a graph. - Xiaolin Chen; Xueliang Li 001 (Ars Comb., 2012)

The generalized connectivity of complete bipartite graphs. - Shasha Li; Wei Li; Xueliang Li 001 (Ars Comb., 2012)

Rainbow Connection Number and Connectivity. - Xueliang Li 001; Sujuan Liu; L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad (Electron. J. Comb., 2012)

A survey on the generalized connectivity of graphs - Xueliang Li 001; Yaping Mao (CoRR, 2012)

Rainbow connection of graphs with diameter 2. - Hengzhe Li; Xueliang Li 001; Sujuan Liu (Discret. Math., 2012)

The generalized 3-connectivity of Cartesian product. - Hengzhe Li; Xueliang Li 001; Yuefang Sun (Discret. Math. Theor. Comput. Sci., 2012)

Upper Bounds for the Rainbow Connection Numbers of Line Graphs. - Xueliang Li 001; Yuefang Sun (Graphs Comb., 2012)

Note on the hardness of generalized connectivity. - Shasha Li; Xueliang Li 001 (J. Comb. Optim., 2012)

Skew Spectra of Oriented Bipartite Graphs. - A. Anuradha; R. Balakrishnan; Xiaolin Chen; Xueliang Li 001; Huishu Lian; Wasin So (Electron. J. Comb., 2013)

Bicyclic graphs with maximal revised Szeged index. - Xueliang Li 001; Mengmeng Liu (Discret. Appl. Math., 2013)

A sharp upper bound for the rainbow 2-connection number of a 2-connected graph. - Xueliang Li 001; Sujuan Liu (Discret. Math., 2013)

Rainbow connection number of dense graphs. - Xueliang Li 001; Mengmeng Liu; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2013)

On the rainbow vertex-connection. - Xueliang Li 001; Yongtang Shi (Discuss. Math. Graph Theory, 2013)

Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs. - Lily Chen; Xueliang Li 001; Huishu Lian (Graphs Comb., 2013)

Rainbow Connection Number, Bridges and Radius. - Jiuying Dong; Xueliang Li 001 (Graphs Comb., 2013)

Rainbow Connection in 3-Connected Graphs. - Xueliang Li 001; Yongtang Shi (Graphs Comb., 2013)

Rainbow Connections of Graphs: A Survey. - Xueliang Li 001; Yongtang Shi; Yuefang Sun (Graphs Comb., 2013)

Solutions to conjectures on the (k, ℓ)-rainbow index of complete graphs. - Qingqiong Cai; Xueliang Li 001; Jiangli Song (Networks, 2013)

Further hardness results on the rainbow vertex-connection number of graphs. - Lily Chen; Xueliang Li 001; Huishu Lian (Theor. Comput. Sci., 2013)

The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs. - Xueliang Li 001; Jun Yue; Yan Zhao 013 (COCOA, 2014)

On the generalized (edge-)connectivity of graphs. - Xueliang Li 001; Yaping Mao; Yuefang Sun (Australas. J Comb., 2014)

Characterize graphs with rainbow connection numbers m-2 and m-3. - Xueliang Li 001; Yuefang Sun; Yan Zhao 013 (Australas. J Comb., 2014)

Rainbow connections for outerplanar graphs with diameter 2 and 3. - Xiaolong Huang; Xueliang Li 001; Yongtang Shi; Jun Yue; Yan Zhao 013 (Appl. Math. Comput., 2014)

Note on the generalized connectivity. - Hengzhe Li; Xueliang Li 001; Yaping Mao; Yuefang Sun (Ars Comb., 2014)

Formally self-dual linear binary codes from circulant graphs. - Ruihu Li; Xueliang Li 001; Yaping Mao; Meiqin Wei (CoRR, 2014)

Additive codes over $GF(4)$ from circulant graphs. - Ruihu Li; Xueliang Li 001; Yaping Mao; Meiqin Wei (CoRR, 2014)

Tricyclic graphs with maximal revised Szeged index. - Lily Chen; Xueliang Li 001; Mengmeng Liu (Discret. Appl. Math., 2014)

Tight upper bound of the rainbow vertex-connection number for 2-connected graphs. - Xueliang Li 001; Sujuan Liu (Discret. Appl. Math., 2014)

Oriented diameter and rainbow connection number of a graph. - Xiaolong Huang; Hengzhe Li; Xueliang Li 001; Yuefang Sun (Discret. Math. Theor. Comput. Sci., 2014)

The generalized 3-connectivity of Lexicographic product graphs. - Xueliang Li 001; Yaping Mao (Discret. Math. Theor. Comput. Sci., 2014)

The (revised) Szeged index and the Wiener index of a nonbipartite graph. - Lily Chen; Xueliang Li 001; Mengmeng Liu (Eur. J. Comb., 2014)

Note on Minimally d-Rainbow Connected Graphs. - Hengzhe Li; Xueliang Li 001; Yuefang Sun; Yan Zhao 013 (Graphs Comb., 2014)

Searching for (near) Optimal Codes. - Xueliang Li 001; Yaping Mao; Meiqin Wei; Ruihu Li (COCOA, 2015)

On shortening construction of self-orthogonal quaternary codes. - Luobin Guo; Qiang Fu 010; Ruihu Li; Xueliang Li 001 (IWSDA, 2015)

On graphs with maximum Harary spectral radius. - Fei Huang; Xueliang Li 001; Shujing Wang 004 (Appl. Math. Comput., 2015)

Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. - Shasha Li; Xueliang Li 001; Yongtang Shi (Appl. Math. Comput., 2015)

Novel inequalities for generalized graph entropies - Graph energies and topological indices. - Xueliang Li 001; Zhongmei Qin; Meiqin Wei; Ivan Gutman; Matthias Dehmer (Appl. Math. Comput., 2015)

An improved Fan-Type degree condition for k-linked graphs. - Jiuying Dong; Xueliang Li 001 (Ars Comb., 2015)

The minimal size of a graph with given generalized 3-edge-connectivity. - Xueliang Li 001; Yaping Mao (Ars Comb., 2015)

Note on a Turan-type problem on distances. - Xueliang Li 001; Jing Ma; Yongtang Shi; Jun Yue (Ars Comb., 2015)

Solution to a Conjecture on the Maximum Skew-Spectral Radius of Odd-Cycle Graphs. - Xiaolin Chen; Xueliang Li 001; Huishu Lian (Electron. J. Comb., 2015)

Connections between generalized graph entropies and graph energy. - Matthias Dehmer; Xueliang Li 001; Yongtang Shi (Complex., 2015)

A survey of recent results in (generalized) graph entropies. - Xueliang Li 001; Meiqin Wei (CoRR, 2015)

The matching energy of random graphs. - Xiaolin Chen; Xueliang Li 001; Huishu Lian (Discret. Appl. Math., 2015)

Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. - Xueliang Li 001; Yaping Mao (Discret. Appl. Math., 2015)

Note on the spanning-tree packing number of lexicographic product graphs. - Hengzhe Li; Xueliang Li 001; Yaping Mao; Jun Yue (Discret. Math., 2015)

The 3-rainbow index of a graph. - Lily Chen; Xueliang Li 001; Kang Yang; Yan Zhao 013 (Discuss. Math. Graph Theory, 2015)

Graphs with 3-rainbow index n-1 and n-2. - Xueliang Li 001; Ingo Schiermeyer; Kang Yang; Yan Zhao 013 (Discuss. Math. Graph Theory, 2015)

Graphs with 4-rainbow index 3 and n-1. - Xueliang Li 001; Ingo Schiermeyer; Kang Yang; Yan Zhao 013 (Discuss. Math. Graph Theory, 2015)

Polynomial reconstruction of the matching polynomial. - Xueliang Li 001; Yongtang Shi; Martin Trinks (Electron. J. Graph Theory Appl., 2015)

Rainbow Connection Number and the Number of Blocks. - Xueliang Li 001; Sujuan Liu (Graphs Comb., 2015)

On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. - Xueliang Li 001; Yaping Mao (Graphs Comb., 2015)

On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound. - Ruihu Li; Xueliang Li 001; Luobin Guo (Quantum Inf. Process., 2015)

Proper connection number and connected dominating sets. - Xueliang Li 001; Meiqin Wei; Jun Yue (Theor. Comput. Sci., 2015)

Note on the upper bound of the rainbow index of a graph. - Qingqiong Cai; Xueliang Li 001; Yan Zhao 013 (Discret. Appl. Math., 2016)

The Steiner Wiener index of a graph. - Ivan Gutman; Xueliang Li 001; Yaping Mao (Discuss. Math. Graph Theory, 2016)

Graphs with large generalized (edge-)connectivity. - Xueliang Li 001; Yaping Mao (Discuss. Math. Graph Theory, 2016)

Rainbow Connection Number and Independence Number of a Graph. - Jiuying Dong; Xueliang Li 001 (Graphs Comb., 2016)

The 3-rainbow index and connected dominating sets. - Qingqiong Cai; Xueliang Li 001; Yan Zhao 013 (J. Comb. Optim., 2016)

Some Motzkin-Straus type results for non-uniform hypergraphs. - Ran Gu; Xueliang Li 001; Yuejian Peng; Yongtang Shi (J. Comb. Optim., 2016)

Upper bounds for the total rainbow connection of graphs. - Hui Jiang; Xueliang Li 001; Yingying Zhang (J. Comb. Optim., 2016)

Construction of quantum caps in projective space PG(r, 4) and quantum codes of distance 4. - Ruihu Li; Qiang Fu 010; Luobin Guo; Xueliang Li 001 (Quantum Inf. Process., 2016)

Proper connection number of random graphs. - Ran Gu; Xueliang Li 001; Zhongmei Qin (Theor. Comput. Sci., 2016)

Conflict-Free Connection Numbers of Line Graphs. - Bo Deng; Wenjing Li; Xueliang Li 001; Yaping Mao; Haixing Zhao (COCOA (1), 2017)

The k-proper index of complete bipartite and complete multipartite graphs. - Wenjing Li; Xueliang Li 001; Jingshu Zhang (Australas. J Comb., 2017)

The k-proper index of graphs. - Lin Chen 013; Xueliang Li 001; Jinfeng Liu 002 (Appl. Math. Comput., 2017)

Hardness result for the total rainbow k-connection of graphs. - Wenjing Li; Xueliang Li 001; Di Wu (Appl. Math. Comput., 2017)

The von Neumann entropy of random multipartite graphs. - Dan Hu; Xueliang Li 001; Xiaogang Liu; Shenggui Zhang (Discret. Appl. Math., 2017)

On two conjectures about the proper connection number of graphs. - Fei Huang; Xueliang Li 001; Zhongmei Qin; Colton Magnant; Kenta Ozeki (Discret. Math., 2017)

Total monochromatic connection of graphs. - Hui Jiang; Xueliang Li 001; Yingying Zhang (Discret. Math., 2017)

Rainbow connection number of graphs with diameter 3. - Xueliang Li 001; Hengzhe Li; Yuefang Sun (Discuss. Math. Graph Theory, 2017)

3-Rainbow Index and Forbidden Subgraphs. - Wenjing Li; Xueliang Li 001; Jingshu Zhang (Graphs Comb., 2017)

Erdős-Gallai-type results for colorful monochromatic connectivity of a graph. - Qingqiong Cai; Xueliang Li 001; Di Wu (J. Comb. Optim., 2017)

Improved upper bound for the degenerate and star chromatic numbers of graphs. - Jiansheng Cai; Xueliang Li 001; Guiying Yan (J. Comb. Optim., 2017)

A solution to a conjecture on the generalized connectivity of graphs. - Lily Chen; Xueliang Li 001; Mengmeng Liu; Yaping Mao (J. Comb. Optim., 2017)

Upper bounds of proper connection number of graphs. - Fei Huang; Xueliang Li 001; Shujing Wang 004 (J. Comb. Optim., 2017)

The (vertex-)monochromatic index of a graph. - Xueliang Li 001; Di Wu (J. Comb. Optim., 2017)

On the difference of two generalized connectivities of a graph. - Yuefang Sun; Xueliang Li 001 (J. Comb. Optim., 2017)

On various (strong) rainbow connection numbers of graphs. - Lin Chen 013; Xueliang Li 001; Henry Liu; Jinfeng Liu 002 (Australas. J Comb., 2018)

On extremal graphs with exactly one Steiner tree connecting any k vertices. - Xueliang Li 001; Yan Zhao 013 (Australas. J Comb., 2018)

Non-jumping numbers for 5-uniform hypergraphs. - Ran Gu; Xueliang Li 001; Zhongmei Qin; Yongtang Shi; Kang Yang (Appl. Math. Comput., 2018)

More on total monochromatic connection of graphs. - Hui Jiang; Xueliang Li 001; Yingying Zhang (Ars Comb., 2018)

Conflict-free connections: algorithm and complexity. - Meng Ji; Xueliang Li 001; Xiaoyu Zhu (CoRR, 2018)

Hardness results for rainbow disconnection of graphs. - Zhong Huang; Xueliang Li 001 (CoRR, 2018)

Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. - Zhiwei Guo; Xueliang Li 001; Chuandong Xu; Shenggui Zhang (Discret. Math., 2018)

Generalized rainbow connection of graphs and their complements. - Xueliang Li 001; Colton Magnant; Meiqin Wei; Xiaoyu Zhu (Discuss. Math. Graph Theory, 2018)

Inverse problem on the Steiner Wiener index. - Ivan Gutman; Xueliang Li 001; Yaping Mao (Discuss. Math. Graph Theory, 2018)

Rainbow vertex-connection and forbidden subgraphs. - Wenjing Li; Xueliang Li 001; Jingshu Zhang (Discuss. Math. Graph Theory, 2018)

Graphs with Conflict-Free Connection Number Two. - Hong Chang 002; Trung Duy Doan; Zhong Huang; Stanislav Jendrol'; Xueliang Li 001; Ingo Schiermeyer (Graphs Comb., 2018)

Some extremal results on the colorful monochromatic vertex-connectivity of a graph. - Qingqiong Cai; Xueliang Li 001; Di Wu (J. Comb. Optim., 2018)

The (k , ℓ)-proper index of graphs. - Hong Chang 002; Xueliang Li 001; Colton Magnant; Zhongmei Qin (J. Comb. Optim., 2018)

On conflict-free connection of graphs. - Hong Chang 002; Zhong Huang; Xueliang Li 001; Yaping Mao; Haixing Zhao (Discret. Appl. Math., 2019)

Kaleidoscopic edge-coloring of complete graphs and r-regular graphs. - Xueliang Li 001; Xiaoyu Zhu (Discuss. Math. Graph Theory, 2019)

Erdős-Gallai-type results for total monochromatic connection of graphs. - Hui Jiang; Xueliang Li 001; Yingying Zhang (Discuss. Math. Graph Theory, 2019)

Skew-rank of an oriented graph and independence number of its underlying graph. - Xueliang Li 001; Wen Xia (J. Comb. Optim., 2019)

Minimum degree condition for proper connection number 2. - Fei Huang; Xueliang Li 001; Zhongmei Qin; Colton Magnant (Theor. Comput. Sci., 2019)

Complexity Results for the Proper Disconnection of Graphs. - You Chen; Ping Li 025; Xueliang Li 001; Yindi Weng (FAW, 2020)

Conflict-free (vertex-)connection numbers of graphs with small diameters. - Xueliang Li 001; Xiaoyu Zhu (Australas. J Comb., 2020)

Strong conflict-free connection of graphs. - Meng Ji; Xueliang Li 001 (Appl. Math. Comput., 2020)

Graph colorings under global structural conditions. - Xuqing Bai; Xueliang Li 001 (CoRR, 2020)

Strong rainbow disconnection in graphs. - Xuqing Bai; Xueliang Li 001 (CoRR, 2020)

Conflict-free connection number of random graphs. - Ran Gu; Xueliang Li 001 (Discret. Appl. Math., 2020)

The asymptotic value of graph energy for random graphs with degree-based weights. - Xueliang Li 001; Yiyang Li 007; Jiarong Song (Discret. Appl. Math., 2020)

Compatible spanning circuits in edge-colored graphs. - Zhiwei Guo; Binlong Li; Xueliang Li 001; Shenggui Zhang (Discret. Math., 2020)

Extremal graphs with maximum monochromatic connectivity. - Zemin Jin; Xueliang Li 001; Yirong Yang (Discret. Math., 2020)

Monochromatic k-edge-connection colorings of graphs. - Ping Li 025; Xueliang Li 001 (Discret. Math., 2020)

Complementary graphs with flows less than three. - Jiaao Li; Xueliang Li 001; Meiling Wang (Discret. Math., 2020)

Conflict-free vertex-connections of graphs. - Stanislav Jendrol'; Xueliang Li 001; Yaping Mao; Yingying Zhang; Haixing Zhao; Xiaoyu Zhu (Discuss. Math. Graph Theory, 2020)

Spanning Triangle-Trees and Flows of Graphs. - Jiaao Li; Xueliang Li 001; Meiling Wang (Graphs Comb., 2020)

More on limited packings in graphs. - Xuqing Bai; Hong Chang 002; Xueliang Li 001 (J. Comb. Optim., 2020)

Analysis of the Graovac-Pisanski Index of Some Polyhedral Graphs Based on Their Symmetry Group. - Modjtaba Ghorbani; Mardjan Hakimi-Nezhaad; Matthias Dehmer; Xueliang Li 001 (Symmetry, 2020)

Hardness results for three kinds of colored connections of graphs. - Zhong Huang; Xueliang Li 001 (Theor. Comput. Sci., 2020)

(Strong) conflict-free connectivity: Algorithm and complexity. - Meng Ji; Xueliang Li 001; Xiaoyu Zhu (Theor. Comput. Sci., 2020)

On the eigenvalue and energy of extended adjacency matrix. - Modjtaba Ghorbani; Xueliang Li 001; Samaneh Zangi; Najaf Amraei (Appl. Math. Comput., 2021)

Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles. - Xiaozheng Chen; Xueliang Li 001 (Discret. Appl. Math., 2021)

Monochromatic disconnection of graphs. - Ping Li 025; Xueliang Li 001 (Discret. Appl. Math., 2021)

Upper bounds for the MD-numbers and characterization of extremal graphs. - Ping Li 025; Xueliang Li 001 (Discret. Appl. Math., 2021)

The vertex- rainbow connection number of some graph operations. - Xueliang Li 001; Hengzhe Li; Yingbin Ma (Discuss. Math. Graph Theory, 2021)

On proper (strong) rainbow connection of graphs. - Hui Jiang; Wenjing Li; Xueliang Li 001; Colton Magnant (Discuss. Math. Graph Theory, 2021)

Rainbow Monochromatic k-Edge-Connection Colorings of Graphs. - Ping Li 025; Xueliang Li 001 (Graphs Comb., 2021)

Conflict-free connection of trees. - Hong Chang 002; Meng Ji; Xueliang Li 001; Jingshu Zhang (J. Comb. Optim., 2021)

Complexity results for two kinds of colored disconnections of graphs. - You Chen; Ping Li 025; Xueliang Li 001; Yindi Weng (J. Comb. Optim., 2021)

Group connectivity under 3-edge-connectivity. - Miaomiao Han; Jiaao Li; Xueliang Li 001; Meiling Wang (J. Graph Theory, 2021)

Digraphs with proper connection number two. - Luyi Li; Xueliang Li 001 (Theor. Comput. Sci., 2021)

Edge-disjoint rainbow triangles in edge-colored graphs. - Luyi Li; Xueliang Li 001 (Discret. Appl. Math., 2022)

Note on rainbow cycles in edge-colored graphs. - Xiaozheng Chen; Xueliang Li 001 (Discret. Math., 2022)

Vertex-disjoint rainbow cycles in edge-colored graphs. - Luyi Li; Xueliang Li 001 (Discret. Math., 2022)

More on the rainbow disconnection in graphs. - Xuqing Bai; Renying Chang; Zhong Huang; Xueliang Li 001 (Discuss. Math. Graph Theory, 2022)

Note on Rainbow Triangles in Edge-Colored Graphs. - Xiaozheng Chen; Xueliang Li 001; Bo Ning 001 (Graphs Comb., 2022)

Further results on the total monochromatic connectivity of graphs. - Yanhong Gao; Ping Li 025; Xueliang Li 001 (J. Comb. Optim., 2022)

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs. - Ping Li 025; Xueliang Li 001 (J. Comb. Optim., 2022)

The proper vertex-disconnection of graphs. - You Chen; Xueliang Li 001 (Theor. Comput. Sci., 2022)

Rainbow edge-pancyclicity of strongly edge-colored graphs. - Luyi Li; Xueliang Li 001 (Theor. Comput. Sci., 2022)

The Flow Index of Regular Class I Graphs. - Jiaao Li; Xueliang Li 001; Meiling Wang (SIAM J. Discret. Math., 2022)

Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs. - Xiaozheng Chen; Xueliang Li 001 (Discret. Math., 2023)

Extremal graphs and classification of planar graphs by MC-numbers. - Yanhong Gao; Ping Li 025; Xueliang Li 001 (Discuss. Math. Graph Theory, 2023)

Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights. - Xueliang Li 001; Ning Yang (Discret. Appl. Math., 2023)

Rainbow structures in a collection of graphs with degree conditions. - Luyi Li; Ping Li 025; Xueliang Li 001 (J. Graph Theory, 2023)

Edge-disjoint properly colored cycles in edge-colored complete graphs. - Xiaozheng Chen; Luyi Li; Xueliang Li 001 (Discret. Appl. Math., 2024)

Vertex-bipancyclicity in a bipartite graph collection. - Jie Hu; Luyi Li; Xueliang Li 001; Ningyan Xu (Discret. Math., 2024)

Counting rainbow triangles in edge-colored graphs. - Xueliang Li 001; Bo Ning 001; Yongtang Shi; Shenggui Zhang (J. Graph Theory, 2024)

Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles. - Luyi Li; Xueliang Li 001; Yuan Si (Discret. Appl. Math., 2024)

Gallai-Ramsey Multiplicity for Rainbow Small Trees. - Xueliang Li 001; Yuan Si (Graphs Comb., 2024)

Every Signed Planar Graph of Girth 5 Has Circular Chromatic Number Strictly Less Than 4. - Jiaao Li; Xueliang Li 001; Zhiqian Wang (Electron. J. Comb., 2025)

Maximum energy bicyclic graphs containing two odd cycles with one common vertex. - Jing Gao; Xueliang Li 001; Ning Yang; Ruiling Zheng (Discret. Appl. Math., 2025)

On maximum induced forests of the balanced bipartite graphs. - Ali Ghalavand; Xueliang Li 001 (Discret. Appl. Math., 2025)

Extremal results on the spectral radius of function-weighted adjacency matrices. - Xueliang Li 001; Ruiling Zheng (Discret. Appl. Math., 2025)

The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights. - Jing Gao; Xueliang Li 001; Ning Yang; Ruiling Zheng (Discret. Math., 2025)

Rainbow directed version of Dirac's theorem. - Hao Li 002; Luyi Li; Ping Li 025; Xueliang Li 001 (Discret. Math., 2025)

Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs. - Luyi Li; Xueliang Li 001; Yaping Mao; Yuan Si (Discuss. Math. Graph Theory, 2025)

Spectral radius of graphs of given size with a forbidden fan graph F6. - Jing Gao; Xueliang Li 001 (Discret. Math., 2026)

On the relationship between (Af)α-spectral radii of graphs with starlike branch tree or bouquet branch graph and its linearly order. - Xueliang Li 001; Ruiling Zheng (Discret. Math., 2026)