default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Richard Lundgren
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j23]David E. Brown, Breeann Flesch, J. Richard Lundgren:
A characterization of 2-tree probe interval graphs. Discuss. Math. Graph Theory 34(3): 509-527 (2014)- 2011
- [j22]J. Richard Lundgren, Breeann Flesch:
A characterization of k-trees that are interval p-graphs. Australas. J Comb. 49: 227-238 (2011)
2000 – 2009
- 2009
- [j21]David E. Brown, J. Richard Lundgren, Li Sheng:
A characterization of cycle-free unit probe interval graphs. Discret. Appl. Math. 157(4): 762-767 (2009) - 2007
- [j20]Faun C. C. Doherty, J. Richard Lundgren:
P/d-Graphs of Tournaments. Ars Comb. 84 (2007) - [j19]J. Richard Lundgren, K. Brooks Reid, Dustin J. Stewart:
The Domination Graphs of Complete Paired Comparison Digraphs. Ars Comb. 85 (2007) - [j18]David E. Brown, Arthur H. Busch, J. Richard Lundgren:
Interval Tournaments. J. Graph Theory 56(1): 72-81 (2007) - 2006
- [j17]J. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart:
Quadrangularity and strong quadrangularity in tournaments. Australas. J Comb. 34: 247-260 (2006) - [j16]David E. Brown, J. Richard Lundgren:
Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs. Australas. J Comb. 35: 221-236 (2006) - 2003
- [j15]David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid:
Domination Graphs of Tournaments with Isolated Vertices. Ars Comb. 66 (2003) - 2002
- [j14]Han Hyuk Cho, Suh-Ryung Kim, J. Richard Lundgren:
Domination graphs of regular tournaments. Discret. Math. 252(1-3): 57-71 (2002) - 2001
- [j13]David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid:
Domination Graphs with Nontrivial Components. Graphs Comb. 17(2): 227-236 (2001)
1990 – 1999
- 1999
- [j12]Steve Bowser, Charles Cable, J. Richard Lundgren:
Niche graphs and mixed pair graphs of tournaments. J. Graph Theory 31(4): 319-332 (1999) - 1998
- [j11]David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid:
The domination and competition graphs of a tournament. J. Graph Theory 29(2): 103-110 (1998) - 1997
- [j10]J. Richard Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen:
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs. Ars Comb. 47 (1997) - 1995
- [j9]Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman:
Competition Graphs of Strongly Connected and Hamiltonian Digraphs. SIAM J. Discret. Math. 8(2): 179-185 (1995) - 1993
- [j8]J. Richard Lundgren, Craig W. Rasmussen, John S. Maybee:
Interval competition graphs of symmetric diagraphs. Discret. Math. 119(1-3): 113-122 (1993) - [j7]J. Richard Lundgren, Craig W. Rasmussen:
Two-step graphs of trees. Discret. Math. 119(1-3): 123-139 (1993) - 1991
- [j6]Kim A. S. Hefner, Kathryn Fraughnaugh Jones, Suh-Ryung Kim, J. Richard Lundgren, Fred S. Roberts
:
(i, j) competition graphs. Discret. Appl. Math. 32(3): 241-262 (1991) - [j5]David A. Gregory, Norman J. Pullman, Kathryn Fraughnaugh Jones, J. Richard Lundgren:
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices. J. Comb. Theory B 51(1): 73-89 (1991)
1980 – 1989
- 1989
- [j4]Charles Cable, Kathryn Fraughnaugh Jones, J. Richard Lundgren, Suzanne M. Seager:
Niche graphs. Discret. Appl. Math. 23(3): 231-241 (1989) - 1985
- [j3]Frank Harary, J. Richard Lundgren, John S. Maybee:
On signed digraphs with all cycles negative. Discret. Appl. Math. 12(2): 155-164 (1985) - 1984
- [j2]Harvey J. Greenberg, J. Richard Lundgren, John S. Maybee:
Inverting graphs of rectangular matrices. Discret. Appl. Math. 8(3): 255-265 (1984) - 1983
- [j1]J. Richard Lundgren, John S. Maybee:
A characterization of graphs of competition number m. Discret. Appl. Math. 6(3): 319-322 (1983)
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-06-10 20:30 CEST 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:
