Endomorphisms of graphs I. The monoid of strong endomorphisms
- 1 June 1989
- journal article
- research article
- Published by Springer Nature in Archiv der Mathematik
- Vol. 52 (6), 607-614
- https://doi.org/10.1007/bf01237575
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Unretractive and S-unretractive joins and lexicographic products of graphsJournal of Graph Theory, 1987
- Wreath products of ordered semigroupsSemigroup Forum, 1983
- On some strongly rigid families of graphs and the full embeddings they induceAlgebra universalis, 1974
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- The group of an X-join of graphsJournal of Combinatorial Theory, 1968
- On Rigid Undirected GraphsCanadian Journal of Mathematics, 1966
- Symmetric relations (undirected graphs) with given semigroupsMonatshefte für Mathematik, 1965
- Graph derivativesMathematische Zeitschrift, 1961
- The composition of graphsDuke Mathematical Journal, 1959
- To the graph theoryČasopis pro pěstování matematiky, 1958