J. Richard Lundgren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
J. Richard Lundgren has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- David E. Brown
Utah State University
2 shared publications - Arthur H. Busch
Department of Mathematics, University of Dayton, Dayton, Ohio 45469-2316
1 shared publication Li Sheng
Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA 19104, United States
1 shared publication
Latest Publications
- 28 February 2009
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (4) , 762-767
A characterization of cycle-free unit probe interval graphs
- 28 February 2009
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (4) , 762-767
A characterization of cycle-free unit probe interval graphs
- 14 June 2007
- Published by Wiley in Journal of Graph Theory
- Vol. 56 (1) , 72-81
Interval Tournaments
A tournament is an orientation of a complete graph. A directed graph is an interval digraph if for each vertex v there corresponds an ordered pair of intervals (Sv, Tv) such that u → v if and only if Su ∩ Tv ≠ ∅︁. A bipartite graph is an interval bigraph if to each vertex there corresponds an interval such that vertices are adjacent if and only if their corresponding intervals intersect and each vertex belongs to a different partite set. We use the equivalence of the models for interval digraphs and interval bigraphs to characterize tournaments that are interval digraphs via forbidden subtournaments and prove that a tournament on n vertices is an interval digraph if and only if it has a transitive (n − 1)‐subtournament. We also characterize the obstructions to the existence of a transitive subtournament of order n − 1 in a tournament of order n. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 72–81, 2007
- 14 June 2007
- Published by Wiley in Journal of Graph Theory
- Vol. 56 (1) , 72-81
Interval Tournaments
A tournament is an orientation of a complete graph. A directed graph is an interval digraph if for each vertex v there corresponds an ordered pair of intervals (Sv, Tv) such that u → v if and only if Su ∩ Tv ≠ ∅︁. A bipartite graph is an interval bigraph if to each vertex there corresponds an interval such that vertices are adjacent if and only if their corresponding intervals intersect and each vertex belongs to a different partite set. We use the equivalence of the models for interval digraphs and interval bigraphs to characterize tournaments that are interval digraphs via forbidden subtournaments and prove that a tournament on n vertices is an interval digraph if and only if it has a transitive (n − 1)‐subtournament. We also characterize the obstructions to the existence of a transitive subtournament of order n − 1 in a tournament of order n. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 72–81, 2007