Semigroups of mappings on graphs
From MaRDI portal
Publication:584533
Cites work
- scientific article; zbMATH DE number 3172754 (Why is no real title available?)
- scientific article; zbMATH DE number 3863483 (Why is no real title available?)
- scientific article; zbMATH DE number 4077575 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3339174 (Why is no real title available?)
- scientific article; zbMATH DE number 3355344 (Why is no real title available?)
- scientific article; zbMATH DE number 3031989 (Why is no real title available?)
- Graphs with Given Group and Given Graph-Theoretical Properties
- Nonconstant Endomorphisms of Lattices
- Note on idempotent semigroups, II
- On Rigid Undirected Graphs
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- On endomorphisms and partial transformations
- On full embeddings of categories of algebras
- On symmetric and antisymmetric relations
- On the endomorphism semigroup (and category) of bounded lattices
- Ordered sets and their inf-endomorphisms
- Products of Idempotent Order-Preserving Transformations
- Products of idempotent order-preserving transformations of arbitrary chains
- Products of idempotents in certain semigroups of transformations
- Relations (graphs) with given finitely generated semigroups
- Roots of increasing sequences
- Symmetric relations (undirected graphs) with given semigroups
- The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
- Unendliche Graphen endlichen Grades mit vorgegebenen Eigenschaften
Cited in
(24)- On definability of universal graphic automata by their input symbol semigroups
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- Elementary definability of the class of universal planar automata in the class of semigroups
- Computing automorphisms of semigroups.
- Semigroups characterizing hypergraphs
- Semigroups of strong endomorphisms of infinite graphs and hypergraphs.
- Bilateral semidirect products of transformation semigroups
- On regularity of semigroups of maps that preserve a binary relation
- Definability of relations by semigroups of isotone transformations
- Inverse monoids of graphs
- An approach to construct an end-regular graph
- Endomorphism semigroups of 2-nilpotent binary relations.
- Catalan monoids, monoids of local endomorphisms, and their presentations
- On epimorphisms of input symbol semigroups, of universal hypergraphic automata
- Generalized symmetry of graphs
- Various inverses of a strong endomorphism of a graph
- Transformation semigroups preserving a binary relation.
- Concrete characterization of universal planar automata
- Semigroup theory of symmetry
- On relatively elementary definability of graph classes in the class of semigroups
- Standard automata and semidirect products of transformation semigroups
- Frucht theorem for inverse semigroups
- Abstract characterization of input symbol semigroups of universal hypergraphic automata
- A method of finding automorphism groups of endomorphism monoids of relational systems.
This page was built for publication: Semigroups of mappings on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584533)
