default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard H. Hammack
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Richard H. Hammack, Paul C. Kainen:
Euler's Theorem for Regular CW-Complexes. Comb. 44(3): 453-465 (2024)- 2021
- [j39]Richard H. Hammack, Jamie L. Shive:
Palindromic products. Art Discret. Appl. Math. 4(1) (2021) - [j38]Richard H. Hammack:
Graph exponentiation and neighborhood reconstruction. Discuss. Math. Graph Theory 41(1): 335-339 (2021) - [j37]Richard H. Hammack, Paul C. Kainen:
A New View of Hypercube Genus. Am. Math. Mon. 128(4): 352-359 (2021) - 2020
- [j36]Richard H. Hammack, Paul C. Kainen:
Sphere decompositions of hypercubes. Art Discret. Appl. Math. 3(2) (2020)
2010 – 2019
- 2018
- [j35]Richard H. Hammack, Wilfried Imrich:
Vertex-Transitive Direct Products of Graphs. Electron. J. Comb. 25(2): 2 (2018) - [j34]Richard H. Hammack, Paul C. Kainen:
Robust cycle bases do not exist for if. Discret. Appl. Math. 235: 206-211 (2018) - [j33]Richard H. Hammack, Paul C. Kainen:
Graph Bases and Diagram Commutativity. Graphs Comb. 34(4): 523-534 (2018) - [p1]Richard H. Hammack:
Digraphs Products. Classes of Directed Graphs 2018: 467-515 - 2017
- [j32]Richard H. Hammack, Gregory D. Smith:
Cycle bases of reduced powers of graphs. Ars Math. Contemp. 12(1): 183-203 (2017) - [j31]Richard H. Hammack, Cristina Mullican:
Neighborhood Reconstruction and Cancellation of Graphs. Electron. J. Comb. 24(2): 2 (2017) - [j30]Richard H. Hammack, Dewey T. Taylor:
Proper connection of direct products. Discuss. Math. Graph Theory 37(4): 1005-1013 (2017) - 2016
- [j29]Richard H. Hammack, Marc Hellmuth
, Lydia Ostermeier, Peter F. Stadler:
Associativity and Non-Associativity of Some Hypergraph Products. Math. Comput. Sci. 10(3): 403-408 (2016) - 2015
- [j28]Richard H. Hammack, Owen Puffenberger:
A prime factor theorem for bipartite graphs. Eur. J. Comb. 47: 123-140 (2015) - 2014
- [j27]Richard H. Hammack, Wilfried Imrich:
Fast recognition of direct and strong products. Ars Math. Contemp. 7(2): 487-497 (2014) - [j26]Richard H. Hammack, Heather C. Smith:
Zero Divisors Among Digraphs. Graphs Comb. 30(1): 171-181 (2014) - 2013
- [j25]Richard H. Hammack:
On uniqueness of prime bipartite factors of graphs. Discret. Math. 313(9): 1018-1027 (2013) - [j24]Richard H. Hammack:
Frucht's theorem for the digraph factorial. Discuss. Math. Graph Theory 33(2): 329-336 (2013) - [j23]Richard H. Hammack:
Cancellation of digraphs over the direct product. Eur. J. Comb. 34(5): 846-858 (2013) - 2011
- [j22]Ghidewon Abay-Asmerom, Richard H. Hammack, Craig E. Larson, Dewey T. Taylor:
Notes on the independence number in the Cartesian product of graphs. Discuss. Math. Graph Theory 31(1): 25-35 (2011) - 2010
- [j21]Laura J. Culp, Richard H. Hammack:
An isomorphism theorem for digraphs. Australas. J Comb. 48: 205-212 (2010) - [j20]Richard H. Hammack, Neal Livesay:
The inner power of a graph. Ars Math. Contemp. 3(2): 193-199 (2010) - [j19]Richard H. Hammack:
A quasicancellation property for the direct product of graphs. Discret. Math. 310(12): 1691-1696 (2010) - [j18]Richard H. Hammack, Katherine E. Toman:
Cancellation of direct products of digraphs. Discuss. Math. Graph Theory 30(4): 575-590 (2010) - [j17]Ghidewon Abay-Asmerom, Richard H. Hammack, Craig E. Larson, Dewey T. Taylor:
Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions. SIAM J. Discret. Math. 23(4): 2042-2052 (2010)
2000 – 2009
- 2009
- [j16]Ghidewon Abay-Asmerom, Richard H. Hammack, Dewey T. Taylor:
Factorial properties of graphs. Australas. J Comb. 44: 265-272 (2009) - [j15]Zachary Bradshaw, Richard H. Hammack:
Minimum cycle bases of direct products of graphs with cycles. Ars Math. Contemp. 2(1): 101-119 (2009) - [j14]Richard H. Hammack, Wilfried Imrich:
On Cartesian skeletons of graphs. Ars Math. Contemp. 2(2): 191-205 (2009) - [j13]Richard H. Hammack:
On direct product cancellation of graphs. Discret. Math. 309(8): 2538-2543 (2009) - [j12]Richard H. Hammack:
Proof of a conjecture concerning the direct product of bipartite graphs. Eur. J. Comb. 30(5): 1114-1118 (2009) - 2008
- [j11]Ghidewon Abay-Asmerom, Richard H. Hammack, Dewey T. Taylor:
Total Perfect Codes in Tensor Products of Graphs. Ars Comb. 88 (2008) - [j10]Richard H. Hammack:
A cancellation property for direct product. Discuss. Math. Graph Theory 28(1): 179-184 (2008) - 2007
- [j9]Richard H. Hammack:
Fractional graphs. Australas. J Comb. 39: 135-140 (2007) - [j8]Richard H. Hammack:
Minimum cycle bases of direct products of complete graphs. Inf. Process. Lett. 102(5): 214-218 (2007) - 2006
- [j7]Richard H. Hammack:
Square contractions of graphs. Australas. J Comb. 36: 13-26 (2006) - [j6]Richard H. Hammack:
Minimum cycle bases of direct products of bipartite graphs. Australas. J Comb. 36: 213-222 (2006) - [j5]Richard H. Hammack:
Isomorphic components of direct products of bipartite graphs. Discuss. Math. Graph Theory 26(2): 231-248 (2006) - 2005
- [j4]Ghidewon Abay-Asmerom, Richard H. Hammack:
Centers of Tensor Products of Graphs. Ars Comb. 74 (2005) - 2004
- [j3]Sarah Bendall, Richard H. Hammack:
Centers of n-fold tensor products of graphs. Discuss. Math. Graph Theory 24(3): 491-501 (2004) - 2002
- [j2]Richard H. Hammack:
A note on the complexity of computing cyclicity. Ars Comb. 63 (2002)
1990 – 1999
- 1999
- [j1]Richard H. Hammack:
Cyclicity of graphs. J. Graph Theory 32(2): 160-170 (1999)
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-05-31 17:56 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:
