Naturally ordered strong endomorphisms on graphs
From MaRDI portal
Publication:2287753
Recommendations
Cites work
- A Natural Partial Order for Semigroups
- A regular endomorphism of a graph and its inverses
- Endomorphism spectra of graphs
- Endomorphisms of graphs. I: The monoid of strong endomorphisms
- Endomorphisms of graphs. II: Various unretractive graphs
- Graphs whose endomorphism monoids are regular
- Graphs with a regular endomorphism monoid
- Graphs with regular monoids
- Green's relations on the strong endomorphism monoid of a graph
- scientific article; zbMATH DE number 912430 (Why is no real title available?)
- scientific article; zbMATH DE number 6423882 (Why is no real title available?)
- scientific article; zbMATH DE number 6730116 (Why is no real title available?)
- Naturally ordered transformation semigroups
- On End-regular graphs
- Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
- The endotype of an (n-3)-regular graph of order n
- The natural partial order on a regular semigroup
- Unretractive and S-unretractive joins and lexicographic products of graphs
Cited in
(4)
This page was built for publication: Naturally ordered strong endomorphisms on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287753)