Citations per year, relative to Xueliang Li Xueliang Li (= 1×)
peers
Lutz Volkmann
Countries citing papers authored by Xueliang Li
Since
Specialization
Citations
This map shows the geographic impact of Xueliang Li's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Xueliang Li with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Xueliang Li more than expected).
This network shows the impact of papers produced by Xueliang Li. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Xueliang Li. The network helps show where Xueliang Li may publish in the future.
Co-authorship network of co-authors of Xueliang Li
This figure shows the co-authorship network connecting the top 25 collaborators of Xueliang Li.
A scholar is included among the top collaborators of Xueliang Li based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Xueliang Li. Xueliang Li is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Jiang, Hui, Xueliang Li, & Yingying Zhang. (2018). More on total monochromatic connection of graphs.. Ars Combinatoria. 136. 263–275.3 indexed citations
Li, Xueliang & Yuefang Sun. (2011). On the rainbow k-connectivity of complete graphs.. Australas. J Comb.. 49. 217–226.11 indexed citations
11.
Li, Xueliang & Yuefang Sun. (2011). Rainbow connection numbers of line graphs.. Ars Combinatoria. 100. 449–463.10 indexed citations
12.
Li, Hao, Xueliang Li, Guizhen Liu, & Guanghui Wang. (2009). The heterochromatic matchings in edge-colored bipartite graphs.. Ars Combinatoria. 93.3 indexed citations
13.
Broersma, Hajo, Xueliang Li, Gerhard J. Woeginger, & Shenggui Zhang. (2005). Paths and cycles in colored graphs. University of Twente Research Information. 31(1). 299–311.47 indexed citations
14.
Li, Xueliang, et al.. (2005). Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph.. Ars Combinatoria. 75.1 indexed citations
15.
Broersma, Hajo & Xueliang Li. (1996). Directed path graphs. University of Twente Research Information.1 indexed citations
16.
Li, Xueliang. (1996). Isomorphism of P 3 -graphs. Journal of Graph Theory. 21(1). 81–85.5 indexed citations
17.
Zhang, Fuji & Xueliang Li. (1996). Forcing bonds of a benzenoid system. Acta Mathematicae Applicatae Sinica English Series. 12(2). 209–215.12 indexed citations
18.
Broersma, Hajo & Xueliang Li. (1995). Spanning trees with many or few colors in edge-colored graphs. Data Archiving and Networked Services (DANS).
19.
Li, Xueliang & Fuji Zhang. (1991). Homomorphisms on n-dimensional line digraphs. University of Twente Research Information.1 indexed citations
20.
Li, Xueliang, et al.. (1991). Hard graphs for the maximum clique problem II. University of Twente Research Information.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.