(Strong) endomorphism monoids of graphs
From MaRDI portal
Recommendations
Cited in
(27)- Idempotent endomorphisms of a graph
- Endomorphisms of graphs. I: The monoid of strong endomorphisms
- Endomorphisms of graphs. II: Various unretractive graphs
- Graphs whose strong endomorphism monoids are regular
- Split graphs whose half-strong endomorphisms form a monoid
- Path strong and cycle strong graph endomorphisms and applications
- REPRESENTING SUBDIRECT PRODUCT MONOIDS BY GRAPHS
- On graphs with a given endomorphism monoid
- scientific article; zbMATH DE number 4035883 (Why is no real title available?)
- scientific article; zbMATH DE number 4099374 (Why is no real title available?)
- scientific article; zbMATH DE number 1382456 (Why is no real title available?)
- Semigroups of strong endomorphisms of infinite graphs and hypergraphs.
- scientific article; zbMATH DE number 51407 (Why is no real title available?)
- scientific article; zbMATH DE number 1264343 (Why is no real title available?)
- scientific article; zbMATH DE number 700008 (Why is no real title available?)
- scientific article; zbMATH DE number 1159832 (Why is no real title available?)
- scientific article; zbMATH DE number 783438 (Why is no real title available?)
- Bipartite graphs and their endomorphism monoids
- scientific article; zbMATH DE number 6423882 (Why is no real title available?)
- The monoid of endomorphisms of disconnected hypergraphs.
- More on unretractive graphs
- scientific article; zbMATH DE number 5274497 (Why is no real title available?)
- Endomorphism monoids of chained graphs
- A strong geometric hyperbolicity property for directed graphs and monoids.
- On concrete characterization problem of endomorphism semigroups of graphs
- On the number of graphs with a given endomorphism monoid
- On wreathed lexicographic products of graphs
This page was built for publication: (Strong) endomorphism monoids of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2735380)