| 2008 |
|---|
| 34 | EE | Robert E. Jamison,
Beth Novick:
Turán theorems and convexity invariants for directed graphs.
Discrete Mathematics 308(20): 4544-4550 (2008) |
| 2007 |
|---|
| 33 | EE | Robert E. Jamison,
Eric Mendelsohn:
On the chromatic spectrum of acyclic decompositions of graphs.
Journal of Graph Theory 56(2): 83-104 (2007) |
| 2006 |
|---|
| 32 | EE | Robert E. Jamison,
Gretchen L. Matthews,
John Villalpando:
Acyclic colorings of products of trees.
Inf. Process. Lett. 99(1): 7-12 (2006) |
| 31 | EE | David Pokrass Jacobs,
Robert E. Jamison:
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree.
J. Discrete Algorithms 4(2): 201-208 (2006) |
| 30 | EE | Martin Charles Golumbic,
Robert E. Jamison:
Rank-tolerance graph classes.
Journal of Graph Theory 52(4): 317-340 (2006) |
| 2005 |
|---|
| 29 | EE | Robert E. Jamison,
John L. Pfaltz:
Closure spaces that are not uniquely generated.
Discrete Applied Mathematics 147(1): 69-79 (2005) |
| 28 | EE | Robert E. Jamison,
Henry Martyn Mulder:
Constant tolerance intersection graphs of subtrees of a tree.
Discrete Mathematics 290(1): 27-46 (2005) |
| 27 | EE | Maria Axenovich,
Robert E. Jamison:
Canonical Pattern Ramsey Numbers.
Graphs and Combinatorics 21(2): 145-160 (2005) |
| 2004 |
|---|
| 26 | EE | Robert E. Jamison,
Douglas B. West:
On Pattern Ramsey Numbers of Graphs.
Graphs and Combinatorics 20(3): 333-339 (2004) |
| 2003 |
|---|
| 25 | EE | Robert E. Jamison:
Transforming Toric Digraphs.
AGTIVE 2003: 328-333 |
| 24 | EE | Robert E. Jamison,
Fred R. McMorris,
Henry Martyn Mulder:
Graphs with only caterpillars as spanning trees.
Discrete Mathematics 272(1): 81-95 (2003) |
| 23 | EE | Robert E. Jamison,
Peter D. Johnson Jr.:
The structure of (t, r)-regular graphs of large order.
Discrete Mathematics 272(2-3): 297-300 (2003) |
| 2002 |
|---|
| 22 | EE | Robert E. Jamison:
The Helly bound for singular sums.
Discrete Mathematics 249(1-3): 117-133 (2002) |
| 2001 |
|---|
| 21 | EE | David Pokrass Jacobs,
Robert E. Jamison:
A note on equal unions in families of sets.
Discrete Mathematics 241(1-3): 387-393 (2001) |
| 20 | | John L. Pfaltz,
Robert E. Jamison:
Closure systems and their structure.
Inf. Sci. 139(3-4): 275-286 (2001) |
| 2000 |
|---|
| 19 | EE | David Pokrass Jacobs,
Robert E. Jamison,
Alice A. McRae:
On the complexity of sign-nonsingularity and equal unions of sets.
ACM Southeast Regional Conference 2000: 232-234 |
| 18 | | Robert E. Jamison,
Beth Novick:
On a Contraction-Expansion Closure in Graphs.
RelMiCS 2000: 113-119 |
| 17 | | Robert E. Jamison,
John L. Pfaltz:
Closure Systems and their Structure.
RelMiCS 2000: 121-132 |
| 16 | EE | Robert E. Jamison,
Henry Martyn Mulder:
Tolerance intersection graphs on binary trees with constant tolerance 3.
Discrete Mathematics 215: 115-131 (2000) |
| 15 | | David Pokrass Jacobs,
Robert E. Jamison:
Complexity of Recognizing Equal Unions in Families of Sets.
J. Algorithms 37(2): 495-504 (2000) |
| 1992 |
|---|
| 14 | EE | Douglas R. Shier,
E. J. Valvo,
Robert E. Jamison:
Generating the States of a Binary Stochastic System.
Discrete Applied Mathematics 37/38: 489-500 (1992) |
| 1990 |
|---|
| 13 | EE | Robert E. Jamison:
Alternating Whitney sums and matchings in trees, part II.
Discrete Mathematics 79(2): 177-189 (1990) |
| 1989 |
|---|
| 12 | EE | Michael O. Albertson,
Robert E. Jamison,
Stephen T. Hedetniemi,
Stephen C. Locke:
The subchromatic number of a graph.
Discrete Mathematics 74(1-2): 33-49 (1989) |
| 11 | EE | Robert E. Jamison:
On the edge achromatic numbers of complete graphs.
Discrete Mathematics 74(1-2): 99-115 (1989) |
| 1987 |
|---|
| 10 | | Robert E. Jamison:
Direction Trees.
Discrete & Computational Geometry 2: 249-254 (1987) |
| 9 | EE | Martin Farber,
Robert E. Jamison:
On local convexity in graphs.
Discrete Mathematics 66(3): 231-247 (1987) |
| 8 | EE | Robert E. Jamison:
Alternating Whitney sums and matchings in trees, part 1.
Discrete Mathematics 67(2): 177-189 (1987) |
| 1986 |
|---|
| 7 | EE | Robert E. Jamison:
Few slopes without collinearity.
Discrete Mathematics 60: 199-206 (1986) |
| 1985 |
|---|
| 6 | EE | Martin Charles Golumbic,
Robert E. Jamison:
Edge and vertex intersection of paths in a tree.
Discrete Mathematics 55(2): 151-159 (1985) |
| 5 | EE | Martin Charles Golumbic,
Robert E. Jamison:
The edge intersection graphs of paths in a tree.
J. Comb. Theory, Ser. B 38(1): 8-22 (1985) |
| 1984 |
|---|
| 4 | EE | Robert E. Jamison,
Richard J. Nowakowski:
A Helly theorem for convexity in graphs.
Discrete Mathematics 51(1): 35-39 (1984) |
| 3 | EE | Robert E. Jamison:
Monotonicity of the mean order of subtrees.
J. Comb. Theory, Ser. B 37(1): 70-78 (1984) |
| 1983 |
|---|
| 2 | EE | Robert E. Jamison:
On the average number of nodes in a subtree of a tree.
J. Comb. Theory, Ser. B 35(3): 207-223 (1983) |
| 1977 |
|---|
| 1 | | Robert E. Jamison:
Covering Finite Fields with Cosets of Subspaces.
J. Comb. Theory, Ser. A 22(3): 253-266 (1977) |
