On the public citation graph
Semigroups of mappings on graphs
0 signed · 61 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/zamm.19600400516openalex-snapshot
C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F
inferredcites →https://doi.org/10.1002/zamm.19690491214openalex-snapshot
R. Hartshorne, Foundations of Projective Geometry. VII + 167 S. m. Abb. New York 1967. W. A. Benjamin, Inc. Preis brosch. $ 8.50
inferredcites →https://doi.org/10.1007/bf01093116openalex-snapshot
Ordered sets and their inf-endomorphisms
inferredcites →https://doi.org/10.1007/bf01295203openalex-snapshot
Unendliche Graphen endlichen Grades mit vorgegebenen Eigenschaften
inferredcites →https://doi.org/10.1007/bf01297365openalex-snapshot
On symmetric and antisymmetric relations
inferredcites →https://doi.org/10.1007/bf01297617openalex-snapshot
Symmetric relations (undirected graphs) with given semigroups
inferredcites →https://doi.org/10.1007/bf01298508openalex-snapshot
Relations (graphs) with given finitely generated semigroups
inferredcites →https://doi.org/10.1007/bf02195272openalex-snapshot
Products of idempotent order-preserving transformations of arbitrary chains
inferredcites →https://doi.org/10.1007/bf02570800openalex-snapshot
On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
inferredcites →https://doi.org/10.1007/bf02572876openalex-snapshot
On endomorphisms and partial transformations
inferredcites →https://doi.org/10.1017/s0013091500026936openalex-snapshot
Products of idempotents in certain semigroups of transformations
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0291032-8openalex-snapshot
Nonconstant Endomorphisms of Lattices
inferredcites →https://doi.org/10.1112/jlms/s2-7.2.357openalex-snapshot
Products of Idempotent Order-Preserving Transformations
inferredcites →https://doi.org/10.1215/ijm/1256054991openalex-snapshot
On full embeddings of categories of algebras
inferredcites →https://doi.org/10.21136/cmj.1979.101624openalex-snapshot
Systems of unary algebras with common endomorphisms. I
inferredcites →https://doi.org/10.2140/pjm.1970.35.639openalex-snapshot
On the endomorphism semigroup (and category) of bounded lattices
inferredcites →https://doi.org/10.3792/pja/1195524790openalex-snapshot
Note on idempotent semigroups, II
inferredcites →https://doi.org/10.3792/pja/1195524791openalex-snapshot
Note on idempotent semigroups, III
inferredcites →https://doi.org/10.4064/fm-68-1-31-50openalex-snapshot
Ordered sets, semilattices, distributive lattices and Boolean algebras with homomorphic endomorphism semigroups
inferredcites →https://doi.org/10.4153/cjm-1957-060-7openalex-snapshot
Graphs with Given Group and Given Graph-Theoretical Properties
inferredcites →https://doi.org/10.4153/cjm-1969-165-5openalex-snapshot
The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-97-8269-7_10openalex-snapshot
Definitions and Theorems Useful for the Understanding of the Structures of Asymmetric Interactions
inferred← citeshttps://doi.org/10.1007/bf02355729openalex-snapshot
Frucht theorem for inverse semigroups
inferred← citeshttps://doi.org/10.1007/bf02574150openalex-snapshot
Catalan monoids, monoids of local endomorphisms, and their presentations
inferred← citeshttps://doi.org/10.1007/bf03025758openalex-snapshot
Bilateral semidirect products of transformation semigroups
inferred← citeshttps://doi.org/10.1007/pl00020981openalex-snapshot
On Definability of Hypergraphs by Their Semigroups of Homomorphisms
inferred← citeshttps://doi.org/10.1007/s00012-022-00780-7openalex-snapshot
On relatively elementary definability of graph classes in the class of semigroups
inferred← citeshttps://doi.org/10.1007/s00233-004-0164-7openalex-snapshot
Dense Relations Are Determined by Their Endomorphism Monoids
inferred← citeshttps://doi.org/10.1007/s10910-016-0653-4openalex-snapshot
Semigroup theory of symmetry
inferred← citeshttps://doi.org/10.1007/s10958-009-9723-5openalex-snapshot
Transformation semigroups preserving a binary relation
inferred← citeshttps://doi.org/10.1007/s10958-009-9735-1openalex-snapshot
Endomorphism semigroups of 2-nilpotent binary relations
inferred← citeshttps://doi.org/10.1007/s10958-014-2001-1openalex-snapshot
Representations of the Strong Endomorphism Monoid of Finite n-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10958-015-2332-6openalex-snapshot
Concrete Characterization of Universal Planar Automata
inferred← citeshttps://doi.org/10.1007/s10958-023-06303-6openalex-snapshot
On Regularity of Semigroups of Maps that Preserve a Binary Relation
inferred← citeshttps://doi.org/10.1007/s11253-013-0820-8openalex-snapshot
Semigroups of Strong Endomorphisms of Infinite Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/s11766-998-0038-yopenalex-snapshot
An approach to construct an end-regular graph
inferred← citeshttps://doi.org/10.1016/0021-8693(85)90026-2openalex-snapshot
Bands with isomorphic endomorphism semigroups
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90234-kopenalex-snapshot
Standard automata and semidirect products of transformation semigroups
inferred← citeshttps://doi.org/10.1016/j.disc.2005.01.007openalex-snapshot
Various inverses of a strong endomorphism of a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.029openalex-snapshot
A method of finding automorphism groups of endomorphism monoids of relational systems
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.079openalex-snapshot
Generalized symmetry of graphs
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.10.001openalex-snapshot
Computing automorphisms of semigroups
inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80038-xopenalex-snapshot
Semigroups Characterizing Hypergraphs
inferred← citeshttps://doi.org/10.1070/rm2005v060n03abeh000847openalex-snapshot
Elementary classification and decidability of theories of derived structures
inferred← citeshttps://doi.org/10.1070/rm2007v062n05abeh004463openalex-snapshot
On semigroups of isotonic transformations of partially ordered sets
inferred← citeshttps://doi.org/10.1134/s0037446619060168openalex-snapshot
Elementary Definability of the Class of Universal Planar Automata in the Class of Semigroups
inferred← citeshttps://doi.org/10.1134/s199047892401006xopenalex-snapshot
Definability of Relations by Semigroups of Isotone Transformations
inferred← citeshttps://doi.org/10.1134/s1995080220020109openalex-snapshot
Abstract Characterization of Input Symbol Semigroups of Universal Hypergraphic Automata
inferred← citeshttps://doi.org/10.1134/s1995080222060166openalex-snapshot
On Epimorphisms of Input Symbol Semigroups, of Universal Hypergraphic Automata
inferred← citeshttps://doi.org/10.18500/1816-9791-2009-9-3-33-37openalex-snapshot
The Green’s Relations and the Generalized Green’s Relations on Certain Transformation Semigroups
inferred← citeshttps://doi.org/10.18500/1816-9791-2020-20-1-42-50openalex-snapshot
On Definability of Universal Graphic Automata by Their Input Symbol Semigroups
inferred← citeshttps://doi.org/10.22405/2226-8383-2019-20-2-259-272openalex-snapshot
Об абстрактной определяемости универсальных гиперграфических автоматов полугруппами входных сигналов
inferred← citeshttps://doi.org/10.24108/preprints-3114436openalex-snapshot
О проблеме определяемости n-арных отношений их полугруппами частичных изотонных преобразований
inferred← citeshttps://doi.org/10.33048/smzh.2019.60.616openalex-snapshot
Элементарная определимость класса универсальных планарных автоматов в классе полугрупп
inferred← citeshttps://doi.org/10.4213/rm1428openalex-snapshot
Элементарная классификация и разрешимость теории производных структур
inferred← citeshttps://doi.org/10.4213/rm8526openalex-snapshot
О полугруппах изотонных преобразований частично упорядоченных множеств
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.