J. Richard Lundgren

23 papers Journal 23
YearRankTypeTitle / Venue / Authors
2014 J jnl
A characterization of 2-tree probe interval graphs.
Discuss. Math. Graph Theory
David E. Brown, Breeann Flesch, J. Richard Lundgren
2011 J jnl
A characterization of k-trees that are interval p-graphs.
Australas. J Comb.
J. Richard Lundgren, Breeann Flesch
2009 J jnl
A characterization of cycle-free unit probe interval graphs.
Discret. Appl. Math.
David E. Brown, J. Richard Lundgren, Li Sheng
2007 J jnl
Interval Tournaments.
J. Graph Theory
David E. Brown, Arthur H. Busch, J. Richard Lundgren
2007 J jnl
P/d-Graphs of Tournaments.
Ars Comb.
Faun C. C. Doherty, J. Richard Lundgren
2007 J jnl
The Domination Graphs of Complete Paired Comparison Digraphs.
Ars Comb.
J. Richard Lundgren, K. Brooks Reid, Dustin J. Stewart
2006 J jnl
Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs.
Australas. J Comb.
David E. Brown, J. Richard Lundgren
2006 J jnl
Quadrangularity and strong quadrangularity in tournaments.
Australas. J Comb.
J. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart
2003 J jnl
Domination Graphs of Tournaments with Isolated Vertices.
Ars Comb.
David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid
2002 J jnl
Domination graphs of regular tournaments.
Discret. Math.
Han Hyuk Cho, Suh-Ryung Kim, J. Richard Lundgren
2001 J jnl
Domination Graphs with Nontrivial Components.
Graphs Comb.
David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid
1999 J jnl
Niche graphs and mixed pair graphs of tournaments.
J. Graph Theory
Steve Bowser, Charles Cable, J. Richard Lundgren
1998 J jnl
The domination and competition graphs of a tournament.
J. Graph Theory
David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid
1997 J jnl
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs.
Ars Comb.
J. Richard Lundgren, Patricia A. McKenna, Larry J. Langley, Sarah K. Merz, Craig W. Rasmussen
1995 J jnl
Competition Graphs of Strongly Connected and Hamiltonian Digraphs.
SIAM J. Discret. Math.
Kathryn Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Norman J. Pullman
1993 J jnl
Interval competition graphs of symmetric diagraphs.
Discret. Math.
J. Richard Lundgren, Craig W. Rasmussen, John S. Maybee
1993 J jnl
Two-step graphs of trees.
Discret. Math.
J. Richard Lundgren, Craig W. Rasmussen
1991 J jnl
(i, j) competition graphs.
Discret. Appl. Math.
Kim A. S. Hefner, Kathryn Fraughnaugh Jones, Suh-Ryung Kim, J. Richard Lundgren, Fred S. Roberts
1991 J jnl
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices.
J. Comb. Theory B
David A. Gregory, Norman J. Pullman, Kathryn Fraughnaugh Jones, J. Richard Lundgren
1989 J jnl
Niche graphs.
Discret. Appl. Math.
Charles Cable, Kathryn Fraughnaugh Jones, J. Richard Lundgren, Suzanne M. Seager
1985 J jnl
On signed digraphs with all cycles negative.
Discret. Appl. Math.
Frank Harary, J. Richard Lundgren, John S. Maybee
1984 J jnl
Inverting graphs of rectangular matrices.
Discret. Appl. Math.
Harvey J. Greenberg, J. Richard Lundgren, John S. Maybee
1983 J jnl
A characterization of graphs of competition number m.
Discret. Appl. Math.
J. Richard Lundgren, John S. Maybee