Multicolorings, measures and games on graphs. - Frank H. Clarke; Robert E. Jamison (Discret. Math., 1976)

Covering Finite Fields with Cosets of Subspaces. - Robert E. Jamison (J. Comb. Theory A, 1977)

On the average number of nodes in a subtree of a tree. - Robert E. Jamison (J. Comb. Theory B, 1983)

A Helly theorem for convexity in graphs. - Robert E. Jamison; Richard J. Nowakowski (Discret. Math., 1984)

Monotonicity of the mean order of subtrees. - Robert E. Jamison (J. Comb. Theory B, 1984)

Edge and vertex intersection of paths in a tree. - Martin Charles Golumbic; Robert E. Jamison (Discret. Math., 1985)

The edge intersection graphs of paths in a tree. - Martin Charles Golumbic; Robert E. Jamison (J. Comb. Theory B, 1985)

Few slopes without collinearity. - Robert E. Jamison (Discret. Math., 1986)

Direction Trees. - Robert E. Jamison (Discret. Comput. Geom., 1987)

On local convexity in graphs. - Martin Farber; Robert E. Jamison (Discret. Math., 1987)

Alternating Whitney sums and matchings in trees, part 1. - Robert E. Jamison (Discret. Math., 1987)

On the Null-Homotopy of Bridged Graphs. - Robert E. Jamison (Eur. J. Comb., 1987)

The subchromatic number of a graph. - Michael O. Albertson; Robert E. Jamison; Stephen T. Hedetniemi; Stephen C. Locke (Discret. Math., 1989)

On the edge achromatic numbers of complete graphs. - Robert E. Jamison (Discret. Math., 1989)

Alternating Whitney sums and matchings in trees, part II. - Robert E. Jamison (Discret. Math., 1990)

Rhythm and Pattern: Discrete Mathematics with an Artistic Connection for Elementary School Teachers. - Robert E. Jamison (Discrete Mathematics in the Schools, 1992)

Generating the States of a Binary Stochastic System. - Douglas R. Shier; E. J. Valvo; Robert E. Jamison (Discret. Appl. Math., 1992)

The spanning trees forced by the path and the star. - Michael F. Bridgland; Robert E. Jamison; Jennifer S. Zito (J. Graph Theory, 1996)

On the complexity of sign-nonsingularity and equal unions of sets. - David Pokrass Jacobs; Robert E. Jamison; Alice A. McRae (ACM Southeast Regional Conference, 2000)

On a Contraction-Expansion Closure in Graphs. - Robert E. Jamison; Beth Novick (RelMiCS, 2000)

Tolerance intersection graphs on binary trees with constant tolerance 3. - Robert E. Jamison; Henry Martyn Mulder (Discret. Math., 2000)

Complexity of Recognizing Equal Unions in Families of Sets. - David Pokrass Jacobs; Robert E. Jamison (J. Algorithms, 2000)

A note on equal unions in families of sets. - David Pokrass Jacobs; Robert E. Jamison (Discret. Math., 2001)

Closure systems and their structure. - John L. Pfaltz; Robert E. Jamison (Inf. Sci., 2001)

The Helly bound for singular sums. - Robert E. Jamison (Discret. Math., 2002)

Archimedean ϕ -tolerance graphs. - Martin Charles Golumbic; Robert E. Jamison; Ann N. Trenk (J. Graph Theory, 2002)

Transforming Toric Digraphs. - Robert E. Jamison (AGTIVE, 2003)

The structure of (t, r)-regular graphs of large order. - Robert E. Jamison; Peter D. Johnson Jr. (Discret. Math., 2003)

Graphs with only caterpillars as spanning trees. - Robert E. Jamison; Fred R. McMorris; Henry Martyn Mulder (Discret. Math., 2003)

Constrained Ramsey numbers of graphs. - Robert E. Jamison; Tao Jiang 003; Alan C. H. Ling (J. Graph Theory, 2003)

On 3-simplicial vertices in planar graphs. - Endre Boros; Robert E. Jamison; Renu C. Laskar; Henry Martyn Mulder (Discuss. Math. Graph Theory, 2004)

On Pattern Ramsey Numbers of Graphs. - Robert E. Jamison; Douglas B. West (Graphs Comb., 2004)

Closure spaces that are not uniquely generated. - Robert E. Jamison; John L. Pfaltz (Discret. Appl. Math., 2005)

Constant tolerance intersection graphs of subtrees of a tree. - Robert E. Jamison; Henry Martyn Mulder (Discret. Math., 2005)

Canonical Pattern Ramsey Numbers. - Maria Axenovich; Robert E. Jamison (Graphs Comb., 2005)

Partial S(k-1, k, v)'s inducing Pk-decompositions of Kv. - Robert E. Jamison; Gaetano Quattrocchi (Australas. J Comb., 2006)

Acyclic colorings of products of trees. - Robert E. Jamison; Gretchen L. Matthews; John Villalpando (Inf. Process. Lett., 2006)

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. - David Pokrass Jacobs; Robert E. Jamison (J. Discrete Algorithms, 2006)

Rank-tolerance graph classes. - Martin Charles Golumbic; Robert E. Jamison (J. Graph Theory, 2006)

On the chromatic spectrum of acyclic decompositions of graphs. - Robert E. Jamison; Eric Mendelsohn (J. Graph Theory, 2007)

Turán theorems and convexity invariants for directed graphs. - Robert E. Jamison; Beth Novick (Discret. Math., 2008)

On the Acyclic Chromatic Number of Hamming Graphs. - Robert E. Jamison; Gretchen L. Matthews (Graphs Comb., 2008)

The 2-star spectrum of stars. - Robert A. Beeler; Robert E. Jamison; Eric Mendelsohn (Australas. J Comb., 2009)

Greedy rankings and arank numbers. - Garth Isaak; Robert E. Jamison; Darren A. Narayan (Inf. Process. Lett., 2009)

Chromatically Supremal Decompositions of Graphs. - Robert E. Jamison; Eric Mendelsohn (Graphs Comb., 2010)

Orientable edge colorings of graphs. - Robert E. Jamison (Discret. Appl. Math., 2011)

Automorphic Decompositions of Graphs. - Robert A. Beeler; Robert E. Jamison (Graphs Comb., 2011)

Towards a comprehensive theory of conflict-tolerance graphs. - Robert E. Jamison (Discret. Appl. Math., 2012)

Max-optimal and sum-optimal labelings of graphs. - Robert E. Jamison; Darren A. Narayan (Inf. Process. Lett., 2012)

Graphs constructible from cycles and complete graphs. - Robert E. Jamison; Henry Martyn Mulder (Discret. Math., 2017)

Dyadic representations of graphs. - Robert E. Jamison; Henry Martyn Mulder (Discret. Math., 2018)

Multithreshold graphs. - Robert E. Jamison; Alan P. Sprague (J. Graph Theory, 2020)