default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert E. Jamison
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j48]Robert E. Jamison
, Alan P. Sprague:
Multithreshold graphs. J. Graph Theory 94(4): 518-530 (2020)
2010 – 2019
- 2018
- [j47]Robert E. Jamison, Henry Martyn Mulder:
Dyadic representations of graphs. Discret. Math. 341(11): 3021-3028 (2018) - 2017
- [j46]Robert E. Jamison, Henry Martyn Mulder:
Graphs constructible from cycles and complete graphs. Discret. Math. 340(9): 2301-2306 (2017) - 2012
- [j45]Robert E. Jamison:
Towards a comprehensive theory of conflict-tolerance graphs. Discret. Appl. Math. 160(18): 2742-2751 (2012) - [j44]Robert E. Jamison, Darren A. Narayan:
Max-optimal and sum-optimal labelings of graphs. Inf. Process. Lett. 112(1-2): 26-31 (2012) - 2011
- [j43]Robert E. Jamison:
Orientable edge colorings of graphs. Discret. Appl. Math. 159(7): 595-604 (2011) - [j42]Robert A. Beeler, Robert E. Jamison:
Automorphic Decompositions of Graphs. Graphs Comb. 27(2): 149-160 (2011) - 2010
- [j41]Robert E. Jamison, Eric Mendelsohn:
Chromatically Supremal Decompositions of Graphs. Graphs Comb. 26(3): 369-382 (2010)
2000 – 2009
- 2009
- [j40]Robert A. Beeler, Robert E. Jamison, Eric Mendelsohn:
The 2-star spectrum of stars. Australas. J Comb. 45: 303-308 (2009) - [j39]Garth Isaak, Robert E. Jamison, Darren A. Narayan:
Greedy rankings and arank numbers. Inf. Process. Lett. 109(15): 825-827 (2009) - 2008
- [j38]Robert E. Jamison, Beth Novick:
Turán theorems and convexity invariants for directed graphs. Discret. Math. 308(20): 4544-4550 (2008) - [j37]Robert E. Jamison, Gretchen L. Matthews:
On the Acyclic Chromatic Number of Hamming Graphs. Graphs Comb. 24(4): 349-360 (2008) - 2007
- [j36]Robert E. Jamison, Eric Mendelsohn:
On the chromatic spectrum of acyclic decompositions of graphs. J. Graph Theory 56(2): 83-104 (2007) - 2006
- [j35]Robert E. Jamison, Gaetano Quattrocchi:
Partial S(k-1, k, v)'s inducing Pk-decompositions of Kv. Australas. J Comb. 35: 341- (2006) - [j34]Robert E. Jamison, Gretchen L. Matthews, John Villalpando:
Acyclic colorings of products of trees. Inf. Process. Lett. 99(1): 7-12 (2006) - [j33]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) - [j32]Martin Charles Golumbic, Robert E. Jamison:
Rank-tolerance graph classes. J. Graph Theory 52(4): 317-340 (2006) - 2005
- [j31]Robert E. Jamison, John L. Pfaltz:
Closure spaces that are not uniquely generated. Discret. Appl. Math. 147(1): 69-79 (2005) - [j30]Robert E. Jamison, Henry Martyn Mulder:
Constant tolerance intersection graphs of subtrees of a tree. Discret. Math. 290(1): 27-46 (2005) - [j29]Maria Axenovich, Robert E. Jamison:
Canonical Pattern Ramsey Numbers. Graphs Comb. 21(2): 145-160 (2005) - 2004
- [j28]Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder:
On 3-simplicial vertices in planar graphs. Discuss. Math. Graph Theory 24(3): 413-421 (2004) - [j27]Robert E. Jamison, Douglas B. West:
On Pattern Ramsey Numbers of Graphs. Graphs Comb. 20(3): 333-339 (2004) - 2003
- [j26]Robert E. Jamison, Fred R. McMorris, Henry Martyn Mulder:
Graphs with only caterpillars as spanning trees. Discret. Math. 272(1): 81-95 (2003) - [j25]Robert E. Jamison, Peter D. Johnson Jr.:
The structure of (t, r)-regular graphs of large order. Discret. Math. 272(2-3): 297-300 (2003) - [j24]Robert E. Jamison, Tao Jiang, Alan C. H. Ling:
Constrained Ramsey numbers of graphs. J. Graph Theory 42(1): 1-16 (2003) - [c5]Robert E. Jamison:
Transforming Toric Digraphs. AGTIVE 2003: 328-333 - 2002
- [j23]Robert E. Jamison:
The Helly bound for singular sums. Discret. Math. 249(1-3): 117-133 (2002) - [j22]Martin Charles Golumbic, Robert E. Jamison, Ann N. Trenk:
Archimedean ϕ -tolerance graphs. J. Graph Theory 41(3): 179-194 (2002) - 2001
- [j21]David Pokrass Jacobs, Robert E. Jamison:
A note on equal unions in families of sets. Discret. Math. 241(1-3): 387-393 (2001) - [j20]John L. Pfaltz, Robert E. Jamison:
Closure systems and their structure. Inf. Sci. 139(3-4): 275-286 (2001) - 2000
- [j19]Robert E. Jamison, Henry Martyn Mulder:
Tolerance intersection graphs on binary trees with constant tolerance 3. Discret. Math. 215: 115-131 (2000) - [j18]David Pokrass Jacobs, Robert E. Jamison:
Complexity of Recognizing Equal Unions in Families of Sets. J. Algorithms 37(2): 495-504 (2000) - [c4]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 - [c3]Robert E. Jamison, Beth Novick:
On a Contraction-Expansion Closure in Graphs. RelMiCS 2000: 113-119 - [c2]Robert E. Jamison, John L. Pfaltz:
Closure Systems and their Structure. RelMiCS 2000: 121-132
1990 – 1999
- 1996
- [j17]Michael F. Bridgland, Robert E. Jamison, Jennifer S. Zito:
The spanning trees forced by the path and the star. J. Graph Theory 23(4): 421-441 (1996) - 1992
- [j16]Douglas R. Shier, E. J. Valvo, Robert E. Jamison:
Generating the States of a Binary Stochastic System. Discret. Appl. Math. 37/38: 489-500 (1992) - [c1]Robert E. Jamison:
Rhythm and Pattern: Discrete Mathematics with an Artistic Connection for Elementary School Teachers. Discrete Mathematics in the Schools 1992: 203-222 - 1990
- [j15]Robert E. Jamison:
Alternating Whitney sums and matchings in trees, part II. Discret. Math. 79(2): 177-189 (1990)
1980 – 1989
- 1989
- [j14]Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke:
The subchromatic number of a graph. Discret. Math. 74(1-2): 33-49 (1989) - [j13]Robert E. Jamison:
On the edge achromatic numbers of complete graphs. Discret. Math. 74(1-2): 99-115 (1989) - 1987
- [j12]Robert E. Jamison:
Direction Trees. Discret. Comput. Geom. 2: 249-254 (1987) - [j11]Martin Farber, Robert E. Jamison:
On local convexity in graphs. Discret. Math. 66(3): 231-247 (1987) - [j10]Robert E. Jamison:
Alternating Whitney sums and matchings in trees, part 1. Discret. Math. 67(2): 177-189 (1987) - [j9]Robert E. Jamison:
On the Null-Homotopy of Bridged Graphs. Eur. J. Comb. 8(4): 421-428 (1987) - 1986
- [j8]Robert E. Jamison:
Few slopes without collinearity. Discret. Math. 60: 199-206 (1986) - 1985
- [j7]Martin Charles Golumbic, Robert E. Jamison:
Edge and vertex intersection of paths in a tree. Discret. Math. 55(2): 151-159 (1985) - [j6]Martin Charles Golumbic, Robert E. Jamison:
The edge intersection graphs of paths in a tree. J. Comb. Theory B 38(1): 8-22 (1985) - 1984
- [j5]Robert E. Jamison, Richard J. Nowakowski:
A Helly theorem for convexity in graphs. Discret. Math. 51(1): 35-39 (1984) - [j4]Robert E. Jamison:
Monotonicity of the mean order of subtrees. J. Comb. Theory B 37(1): 70-78 (1984) - 1983
- [j3]Robert E. Jamison:
On the average number of nodes in a subtree of a tree. J. Comb. Theory B 35(3): 207-223 (1983)
1970 – 1979
- 1977
- [j2]Robert E. Jamison:
Covering Finite Fields with Cosets of Subspaces. J. Comb. Theory A 22(3): 253-266 (1977) - 1976
- [j1]Frank H. Clarke, Robert E. Jamison:
Multicolorings, measures and games on graphs. Discret. Math. 14(3): 241-245 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
