J. Richard Lundgren

37 papers receiving 258 citations

Peers

J. Richard Lundgren
Comparison fields: 5 of 34
  • Computational Theory and Mathematics 233
  • Geometry and Topology 79
  • Computer Networks and Communications 77
  • Discrete Mathematics and Combinatorics 70
  • Electrical and Electronic Engineering 58
Replace Pierre Duchet with:
Pierre Duchet France
Dennis P. Geller United States
C. Berge France
Luděk Kučera Czechia
Iztok Peterin Slovenia
Geňa Hahn Canada
A.M.H. Gerards Netherlands
Robin A. Moser Switzerland
Katherine Heinrich Canada
Stephan Kreutzer Germany
J. Richard Lundgren relative to Pierre Duchet France Pierre Duchet's profile →
Citations per field
00.5×1.5×2.3×
Pierre Duchet · 1×
Citations per year

Countries citing papers authored by J. Richard Lundgren

Since Specialization
Citations

This map shows the geographic impact of J. Richard Lundgren'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 J. Richard Lundgren with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. Richard Lundgren more than expected).

Fields of papers citing papers by J. Richard Lundgren

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J. Richard Lundgren. 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 J. Richard Lundgren. The network helps show where J. Richard Lundgren may publish in the future.

Co-authorship network of co-authors of J. Richard Lundgren

This figure shows the co-authorship network connecting the top 25 collaborators of J. Richard Lundgren. A scholar is included among the top collaborators of J. Richard Lundgren 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 J. Richard Lundgren. J. Richard Lundgren is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1
A characterization of k-trees that are interval p-graphs.
3
2 0
3 1
4
Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs.
5
5
Bipartite Probe Interval Graphs, Interval Point Bigraphs, and Circular ArcGraphs
1
6
Quadrangularity and Strong Quadrangularity in Tournaments
4
7
Domination Graphs of Tournaments with Isolated Vertices.
4
8 6
9
Characterizations of Interval Bigraphs and Unit IntervalBigraphs
5
10
The p-competition graphs of strongly connected and Hamiltonian digraphs
1
11 4
12 16
13 13
14 6
15 38
16 7
17 18
18 20
19 6
20 6

About J. Richard Lundgren

J. Richard Lundgren is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 39 papers that have together received 312 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (27 papers), Graph theory and applications (13 papers) and graph theory and CDMA systems (11 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (70 citations), Computational Theory and Mathematics (233 citations) and Geometry and Topology (79 citations). J. Richard Lundgren has collaborated with scholars based in United States, Canada and South Korea. Frequent co-authors include John S. Maybee, Harvey J. Greenberg, Sarah K. Merz, David E. Brown, K. B. Reid, David Fisher, Norman J. Pullman, David Finkel, Suh-Ryung Kim and David A. Gregory. Their work appears in journals such as Annals of Operations Research, Linear Algebra and its Applications and Journal of Algebra.

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026