Dingjun Lou
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 52
- Graph Labeling and Dimension Problems 11
- Complexity and Algorithms in Graphs 8
-
- Interconnection Networks and Systems 33
- Co-authors
- Derek Holton (7 shared papers)Qinglin Yu (3 shared papers)Jun Liang (6 shared papers)Michael D. Plummer (1 shared paper)Robert E. L. Aldred (4 shared papers)Akira Saito (6 shared papers)Yueping Li (7 shared papers)Wei Wang (2 shared papers)
- Journals
- Discrete Mathematics (17 papers)Journal of Graph Theory (3 papers)Discrete Applied Mathematics (2 papers)Journal of Combinatorial Optimization (2 papers)Graphs and Combinatorics (2 papers)
- Partner nations
- ChinaNew ZealandJapan
In The Last Decade
Dingjun Lou
55 papers receiving 282 citations
Peers
Comparison fields: 5 of 22
- Discrete Mathematics and Combinatorics 90
- Computational Theory and Mathematics 264
- Geometry and Topology 118
- Computer Networks and Communications 157
- Computer Graphics and Computer-Aided Design 18
Countries citing papers authored by Dingjun Lou
This map shows the geographic impact of Dingjun Lou'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 Dingjun Lou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dingjun Lou more than expected).
Fields of papers citing papers by Dingjun Lou
This network shows the impact of papers produced by Dingjun Lou. 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 Dingjun Lou. The network helps show where Dingjun Lou may publish in the future.
Co-authors
The 23 scholars most cited alongside Dingjun Lou, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 62 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1991 | 29 | |
| 2 | 1993 | 29 | |
| 3 | 2003 | 18 | |
| 4 | 2003 | 13 | |
| 5 | 1999 | 12 | |
| 6 | 1996 | 12 | |
| 7 | An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs. | 2005 | 10 |
| 8 | 2018 | 10 | |
| 9 | 2016 | 9 | |
| 10 | 2019 | 9 | |
| 11 | Matching extensions of strongly regular graphs. | 1992 | 9 |
| 12 | Some conditions for n-extendable graphs. | 1994 | 9 |
| 13 | 1996 | 8 | |
| 14 | 1993 | 7 | |
| 15 | Sufficient conditions for n-matchable graphs. | 2004 | 7 |
| 16 | On matchability of graphs. | 2000 | 7 |
| 17 | An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs. | 2014 | 6 |
| 18 | Vertex-disjoint cycles containing specified edges in a bipartite graph | 2001 | 6 |
| 19 | 2004 | 6 | |
| 20 | Equivalence between Extendability and Factor-Criticality. | 2007 | 4 |
About Dingjun Lou
Dingjun Lou is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Geometry and Topology and Algebra and Number Theory, having authored 62 papers that have together received 292 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (52 papers), Interconnection Networks and Systems (33 papers), Graph theory and applications (16 papers), Graph Labeling and Dimension Problems (11 papers), graph theory and CDMA systems (9 papers), Limits and Structures in Graph Theory (8 papers), Complexity and Algorithms in Graphs (8 papers) and Finite Group Theory Research (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (90 citations), Computational Theory and Mathematics (264 citations), Geometry and Topology (118 citations), Computer Networks and Communications (157 citations) and Computer Graphics and Computer-Aided Design (18 citations). Dingjun Lou has collaborated with scholars based in China, New Zealand and Japan. Frequent co-authors include Derek Holton, Qinglin Yu, Jun Liang, Michael D. Plummer, Robert E. L. Aldred, Akira Saito, Yueping Li, Wei Wang, Ning Zhong and Guantao Chen. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, Journal of Combinatorial Optimization and Graphs and Combinatorics.
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.