Semigroups of mappings on graphs
DOI10.1007/BF02572738zbMATH Open0523.20041OpenAlexW1986322439MaRDI QIDQ584533FDOQ584533
Authors: V. A. Molchanov 
Publication date: 1983
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134622
surveyendomorphism semigroupsprojective planeshypergraphscoloring semigroupsdirected transformationsorder graphspartial endomorphismssemigroups of graph mappings
Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Semigroups of transformations, relations, partitions, etc. (20M20)
Cites Work
- Graphs with Given Group and Given Graph-Theoretical Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Products of idempotents in certain semigroups of transformations
- Title not available (Why is that?)
- On full embeddings of categories of algebras
- Symmetric relations (undirected graphs) with given semigroups
- Nonconstant Endomorphisms of Lattices
- Note on idempotent semigroups, II
- Products of idempotent order-preserving transformations of arbitrary chains
- Products of Idempotent Order-Preserving Transformations
- The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
- Roots of increasing sequences
- Relations (graphs) with given finitely generated semigroups
- On the endomorphism semigroup (and category) of bounded lattices
- Ordered sets and their inf-endomorphisms
- On symmetric and antisymmetric relations
- On endomorphisms and partial transformations
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Rigid Undirected Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unendliche Graphen endlichen Grades mit vorgegebenen Eigenschaften
Cited In (24)
- Semigroups of strong endomorphisms of infinite graphs and hypergraphs.
- Various inverses of a strong endomorphism of a graph
- Standard automata and semidirect products of transformation semigroups
- On relatively elementary definability of graph classes in the class of semigroups
- Elementary definability of the class of universal planar automata in the class of semigroups
- Endomorphism semigroups of 2-nilpotent binary relations.
- A method of finding automorphism groups of endomorphism monoids of relational systems.
- Bilateral semidirect products of transformation semigroups
- Generalized symmetry of graphs
- Frucht theorem for inverse semigroups
- An approach to construct an end-regular graph
- Computing automorphisms of semigroups.
- Semigroup theory of symmetry
- On epimorphisms of input symbol semigroups, of universal hypergraphic automata
- Abstract characterization of input symbol semigroups of universal hypergraphic automata
- Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs
- On Definability of Universal Graphic Automata by Their Input Symbol Semigroups
- Definability of relations by semigroups of isotone transformations
- Transformation semigroups preserving a binary relation.
- On regularity of semigroups of maps that preserve a binary relation
- Semigroups characterizing hypergraphs
- Inverse monoids of graphs
- Concrete characterization of universal planar automata
- Catalan monoids, monoids of local endomorphisms, and their presentations
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)
