On the public citation graph

Symmetric relations (undirected graphs) with given semigroups

https://doi.org/10.1007/bf01297617
0 signed · 75 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.1007/bf01298508openalex-snapshot
Relations (graphs) with given finitely generated semigroups
inferredcites →https://doi.org/10.1007/bf01304185openalex-snapshot
Relations (graphs) with given infinite semigroups
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032497.ch17openalex-snapshot
Miscellaneous Problems
inferred← citeshttps://doi.org/10.1002/jgt.20396openalex-snapshot
On graphs with a given endomorphism monoid
inferred← citeshttps://doi.org/10.1002/jgt.23262openalex-snapshot
On Endomorphism Universality of Sparse Graph Classes
inferred← citeshttps://doi.org/10.1002/jgt.3190110316openalex-snapshot
Unretractive and S‐unretractive joins and lexicographic products of graphs
inferred← citeshttps://doi.org/10.1002/mana.19790870108openalex-snapshot
On the Edge-sets of Rigid and Corigid Graphs
inferred← citeshttps://doi.org/10.1006/jctb.2000.1970openalex-snapshot
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)
inferred← citeshttps://doi.org/10.1007/bf01207836openalex-snapshot
Graphs with a regular endomorphism monoid
inferred← citeshttps://doi.org/10.1007/bf01237575openalex-snapshot
Endomorphisms of graphs I. The monoid of strong endomorphisms
inferred← citeshttps://doi.org/10.1007/bf01297365openalex-snapshot
On symmetric and antisymmetric relations
inferred← citeshttps://doi.org/10.1007/bf01299296openalex-snapshot
Automorphism groups of posets and lattices with a given subset of fixed points
inferred← citeshttps://doi.org/10.1007/bf01763170openalex-snapshot
Gruppenuniversalität und Homogenisierbarkeit
inferred← citeshttps://doi.org/10.1007/bf01896481openalex-snapshot
Asymmetric trees with two prescribed degrees
inferred← citeshttps://doi.org/10.1007/bf01901979openalex-snapshot
Automorphism group and category of cospectral graphs
inferred← citeshttps://doi.org/10.1007/bf01994056openalex-snapshot
Some properties of the category of integral domains
inferred← citeshttps://doi.org/10.1007/bf02485713openalex-snapshot
On some strongly rigid families of graphs and the full embeddings they induce
inferred← citeshttps://doi.org/10.1007/bf02570800openalex-snapshot
On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
inferred← citeshttps://doi.org/10.1007/bf02572738openalex-snapshot
Semigroups of mappings on graphs
inferred← citeshttps://doi.org/10.1007/bf02944972openalex-snapshot
Representing monoids by mappings preserving equivalences
inferred← citeshttps://doi.org/10.1007/bf02945020openalex-snapshot
Full embeddings into some categories of graphs
inferred← citeshttps://doi.org/10.1007/bfb0058650openalex-snapshot
Algebras and relational structures
inferred← citeshttps://doi.org/10.1007/bfb0098463openalex-snapshot
A note on varieties of graph algebras
inferred← citeshttps://doi.org/10.1007/pl00000343openalex-snapshot
Finite-to-finite universal quasivarieties are Q-universal
inferred← citeshttps://doi.org/10.1007/s00009-022-02226-9openalex-snapshot
On monoid graphs
inferred← citeshttps://doi.org/10.1007/s00012-002-8170-7openalex-snapshot
The lattice of quasivarieties of undirected graphs
inferred← citeshttps://doi.org/10.1007/s00012-008-2071-3openalex-snapshot
Pseudocomplemented semilattices are finite-to-finite relatively universal
inferred← citeshttps://doi.org/10.1007/s00022-009-0010-xopenalex-snapshot
On diversity and stability of unit bases for the Euclidean metric
inferred← citeshttps://doi.org/10.1007/s00233-013-9471-1openalex-snapshot
Endomorphism monoids in varieties of commutative semigroups
inferred← citeshttps://doi.org/10.1007/s00493-025-00140-8openalex-snapshot
Gadget Construction and Structural Convergence
inferred← citeshttps://doi.org/10.1007/s10485-007-9122-3openalex-snapshot
Almost ff-universality Implies Q-universality
inferred← citeshttps://doi.org/10.1007/s10801-023-01282-yopenalex-snapshot
Beyond symmetry in generalized Petersen graphs
inferred← citeshttps://doi.org/10.1007/s10910-016-0653-4openalex-snapshot
Semigroup theory of symmetry
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90010-6openalex-snapshot
Automorphism groups of planar graphs I
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90190-5openalex-snapshot
Vector representable matroids of given rank with given automorphism group
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90113-2openalex-snapshot
On semigroups of graph endomorphisms
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90073-1openalex-snapshot
Homomorphisms of 3-chromatic graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90277-mopenalex-snapshot
Endomorphism spectra of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90675-6openalex-snapshot
Endomorphisms of undirected modifications of directed graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90689-dopenalex-snapshot
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90038-4openalex-snapshot
Every finite graph is a full subgraph of a rigid graph
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90073-8openalex-snapshot
Endomorphism monoids and topological subgraphs of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(81)90052-6openalex-snapshot
Quotients of rigid graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90056-xopenalex-snapshot
Symmetric graphs and interpretations
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90039-7openalex-snapshot
Chromatically optimal rigid graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90132-jopenalex-snapshot
On the complexity of H-coloring
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00134-yopenalex-snapshot
Homomorphically full graphs
inferred← citeshttps://doi.org/10.1016/0166-8641(89)90087-4openalex-snapshot
Nonconstant continuous maps of spaces and of their β-compactifications
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50008-3openalex-snapshot
Generalized Colorings
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.055openalex-snapshot
A surprising permanence of old motivations (a not-so-rigid story)
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.031openalex-snapshot
Almost all graphs are rigid—revisited
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.013openalex-snapshot
On the number of graphs with a given endomorphism monoid
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2021.10.033openalex-snapshot
Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
inferred← citeshttps://doi.org/10.1016/s0095-8956(78)80008-2openalex-snapshot
Infinite digraphs with given regular automorphism groups
inferred← citeshttps://doi.org/10.1016/s0166-8641(02)00103-7openalex-snapshot
Universal topological unary varieties
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70464-3openalex-snapshot
The Existence Problem for Graph Homomorphisms
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70636-8openalex-snapshot
Irreconstructability of Finite Undirected Graphs from Large Subgraphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80005-4openalex-snapshot
Images of Rigid Digraphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73252-3openalex-snapshot
High Chromatic Rigid Graphs II
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73267-5openalex-snapshot
Homomorphism Interpolation and Approximation
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70380-5openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/s0004972700010248openalex-snapshot
Kleene algebras are almost universal
inferred← citeshttps://doi.org/10.1017/s1446788700022904openalex-snapshot
Completely rigid graphs
inferred← citeshttps://doi.org/10.1023/a:1016024925028openalex-snapshot
$$\mathcal{Q}$$ -Universal Quasivarieties of Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9939-1984-0735556-3openalex-snapshot
Universality of Small Lattice Varieties
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32819.xopenalex-snapshot
AMALGAMATION OF GRAPHS AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.1142/9789814335843_0009openalex-snapshot
MISCELLANEOUS PROBLEMS
inferred← citeshttps://doi.org/10.1142/s0218196709005275openalex-snapshot
REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
inferred← citeshttps://doi.org/10.11650/twjm/1500407157openalex-snapshot
ASPECTS OF STRUCTURAL COMBINATORICS (Graph Homomorphisms and Their Use)
inferred← citeshttps://doi.org/10.3103/s1055134418010042openalex-snapshot
Quasivarieties of Graphs and Independent Axiomatizability
inferred← citeshttps://doi.org/10.4153/cjm-1966-121-7openalex-snapshot
On Rigid Undirected Graphs
inferred← citeshttps://doi.org/10.5562/cca2303openalex-snapshot
Color Symmetry, Semigroups, Fractals
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.