Robert E. Jamison

53 papers Journal 48Unranked 5
YearRankTypeTitle / Venue / Authors
2020 J jnl
Multithreshold graphs.
J. Graph Theory
Robert E. Jamison, Alan P. Sprague
2018 J jnl
Dyadic representations of graphs.
Discret. Math.
Robert E. Jamison, Henry Martyn Mulder
2017 J jnl
Graphs constructible from cycles and complete graphs.
Discret. Math.
Robert E. Jamison, Henry Martyn Mulder
2012 J jnl
Max-optimal and sum-optimal labelings of graphs.
Inf. Process. Lett.
Robert E. Jamison, Darren A. Narayan
2012 J jnl
Towards a comprehensive theory of conflict-tolerance graphs.
Discret. Appl. Math.
Robert E. Jamison
2011 J jnl
Automorphic Decompositions of Graphs.
Graphs Comb.
Robert A. Beeler, Robert E. Jamison
2011 J jnl
Orientable edge colorings of graphs.
Discret. Appl. Math.
Robert E. Jamison
2010 J jnl
Chromatically Supremal Decompositions of Graphs.
Graphs Comb.
Robert E. Jamison, Eric Mendelsohn
2009 J jnl
Greedy rankings and arank numbers.
Inf. Process. Lett.
Garth Isaak, Robert E. Jamison, Darren A. Narayan
2009 J jnl
The 2-star spectrum of stars.
Australas. J Comb.
Robert A. Beeler, Robert E. Jamison, Eric Mendelsohn
2008 J jnl
On the Acyclic Chromatic Number of Hamming Graphs.
Graphs Comb.
Robert E. Jamison, Gretchen L. Matthews
2008 J jnl
Turán theorems and convexity invariants for directed graphs.
Discret. Math.
Robert E. Jamison, Beth Novick
2007 J jnl
On the chromatic spectrum of acyclic decompositions of graphs.
J. Graph Theory
Robert E. Jamison, Eric Mendelsohn
2006 J jnl
Acyclic colorings of products of trees.
Inf. Process. Lett.
Robert E. Jamison, Gretchen L. Matthews, John Villalpando
2006 J jnl
Partial S(k-1, k, v)'s inducing P
Australas. J Comb.
Robert E. Jamison, Gaetano Quattrocchi
2006 J jnl
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree.
J. Discrete Algorithms
David Pokrass Jacobs, Robert E. Jamison
2006 J jnl
Rank-tolerance graph classes.
J. Graph Theory
Martin Charles Golumbic, Robert E. Jamison
2005 J jnl
Canonical Pattern Ramsey Numbers.
Graphs Comb.
Maria Axenovich, Robert E. Jamison
2005 J jnl
Closure spaces that are not uniquely generated.
Discret. Appl. Math.
Robert E. Jamison, John L. Pfaltz
2005 J jnl
Constant tolerance intersection graphs of subtrees of a tree.
Discret. Math.
Robert E. Jamison, Henry Martyn Mulder
2004 J jnl
On 3-simplicial vertices in planar graphs.
Discuss. Math. Graph Theory
Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder
2004 J jnl
On Pattern Ramsey Numbers of Graphs.
Graphs Comb.
Robert E. Jamison, Douglas B. West
2003 J jnl
Constrained Ramsey numbers of graphs.
J. Graph Theory
Robert E. Jamison, Tao Jiang, Alan C. H. Ling
2003 J jnl
Graphs with only caterpillars as spanning trees.
Discret. Math.
Robert E. Jamison, Fred R. McMorris, Henry Martyn Mulder
2003 J jnl
The structure of (
Discret. Math.
Robert E. Jamison, Peter D. Johnson Jr.
2003 — conf
Transforming Toric Digraphs.
AGTIVE
Robert E. Jamison
2002 J jnl
Archimedean ϕ -tolerance graphs.
J. Graph Theory
Martin Charles Golumbic, Robert E. Jamison, Ann N. Trenk
2002 J jnl
The Helly bound for singular sums.
Discret. Math.
Robert E. Jamison
2001 J jnl
A note on equal unions in families of sets.
Discret. Math.
David Pokrass Jacobs, Robert E. Jamison
2001 J jnl
Closure systems and their structure.
Inf. Sci.
John L. Pfaltz, Robert E. Jamison
2000 — conf
Closure Systems and their Structure.
RelMiCS
Robert E. Jamison, John L. Pfaltz
2000 J jnl
Complexity of Recognizing Equal Unions in Families of Sets.
J. Algorithms
David Pokrass Jacobs, Robert E. Jamison
2000 — conf
On a Contraction-Expansion Closure in Graphs.
RelMiCS
Robert E. Jamison, Beth Novick
2000 — conf
On the complexity of sign-nonsingularity and equal unions of sets.
ACM Southeast Regional Conference
David Pokrass Jacobs, Robert E. Jamison, Alice A. McRae
2000 J jnl
Tolerance intersection graphs on binary trees with constant tolerance 3.
Discret. Math.
Robert E. Jamison, Henry Martyn Mulder
1996 J jnl
The spanning trees forced by the path and the star.
J. Graph Theory
Michael F. Bridgland, Robert E. Jamison, Jennifer S. Zito
1992 J jnl
Generating the States of a Binary Stochastic System.
Discret. Appl. Math.
Douglas R. Shier, E. J. Valvo, Robert E. Jamison
1992 — conf
Rhythm and Pattern: Discrete Mathematics with an Artistic Connection for Elementary School Teachers.
Discrete Mathematics in the Schools
Robert E. Jamison
1990 J jnl
Alternating Whitney sums and matchings in trees, part II.
Discret. Math.
Robert E. Jamison
1989 J jnl
On the edge achromatic numbers of complete graphs.
Discret. Math.
Robert E. Jamison
1989 J jnl
The subchromatic number of a graph.
Discret. Math.
Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
1987 J jnl
Alternating Whitney sums and matchings in trees, part 1.
Discret. Math.
Robert E. Jamison
1987 J jnl
Direction Trees.
Discret. Comput. Geom.
Robert E. Jamison
1987 J jnl
On local convexity in graphs.
Discret. Math.
Martin Farber, Robert E. Jamison
1987 J jnl
On the Null-Homotopy of Bridged Graphs.
Eur. J. Comb.
Robert E. Jamison
1986 J jnl
Few slopes without collinearity.
Discret. Math.
Robert E. Jamison
1985 J jnl
Edge and vertex intersection of paths in a tree.
Discret. Math.
Martin Charles Golumbic, Robert E. Jamison
1985 J jnl
The edge intersection graphs of paths in a tree.
J. Comb. Theory B
Martin Charles Golumbic, Robert E. Jamison
1984 J jnl
A Helly theorem for convexity in graphs.
Discret. Math.
Robert E. Jamison, Richard J. Nowakowski
1984 J jnl
Monotonicity of the mean order of subtrees.
J. Comb. Theory B
Robert E. Jamison
1983 J jnl
On the average number of nodes in a subtree of a tree.
J. Comb. Theory B
Robert E. Jamison
1977 J jnl
Covering Finite Fields with Cosets of Subspaces.
J. Comb. Theory A
Robert E. Jamison
1976 J jnl
Multicolorings, measures and games on graphs.
Discret. Math.
Frank H. Clarke, Robert E. Jamison