On the public citation graph

Graphs and universal algebras

https://doi.org/10.1007/bfb0091831
0 signed · 17 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1017/s0004972700006481openalex-snapshot
Murskii's algebra does not satisfy min
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.4153/cjm-1968-151-xopenalex-snapshot
The Categorical Product of Graphs
inferredcites →https://doi.org/10.7146/math.scand.a-10817openalex-snapshot
Boolean Operations on Graphs.
inferredcites →https://doi.org/10.7302/14840openalex-snapshot
Homomorphisms Of Graphs And Automata.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19890350311openalex-snapshot
The Equational Logic For Graph Algebras
inferred← citeshttps://doi.org/10.1007/bf01189000openalex-snapshot
Graph algebras and graph varieties
inferred← citeshttps://doi.org/10.1007/bf03011618openalex-snapshot
A class of semisimple automata
inferred← citeshttps://doi.org/10.1007/s10469-008-9036-7openalex-snapshot
Complex algebras of subalgebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00544-3openalex-snapshot
On congruences of automata defined by directed graphs
inferred← citeshttps://doi.org/10.1017/s0004972700002756openalex-snapshot
Graph varieties containing Murskii's groupoid
inferred← citeshttps://doi.org/10.1017/s0004972700018992openalex-snapshot
Syntactic semigroups and graph algebras
inferred← citeshttps://doi.org/10.1017/s0004972700026526openalex-snapshot
The dimension of graphs with respect to the direct powers of a two-element graph
inferred← citeshttps://doi.org/10.1080/0020716021000049765openalex-snapshot
Two algorithms for languages recognized by graph algebras
inferred← citeshttps://doi.org/10.1080/00207160214649openalex-snapshot
Two Algorithms For Languages Recognized By Graph Algebras
inferred← citeshttps://doi.org/10.21136/cmj.1989.102278openalex-snapshot
Shift-automorphism methods for inherently nonfinitely based varieties of algebras
inferred← citeshttps://doi.org/10.48550/arxiv.math/0610832openalex-snapshot
On complex algebras of subalgebras
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.