On some strongly rigid families of graphs and the full embeddings they induce
- 1 December 1974
- journal article
- Published by Springer Nature in Algebra universalis
- Vol. 4 (1) , 108-126
- https://doi.org/10.1007/bf02485713
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On a technique for representing semigroups as endomorphism semigroups of graphs with given propertiesSemigroup Forum, 1972
- Full embeddings into some categories of graphsAlgebra universalis, 1972
- Any boundable binding category contains a proper class of mutually disjoint copies of itselfAlgebra universalis, 1971
- Every finite graph is a full subgraph of a rigid graphJournal of Combinatorial Theory, Series B, 1971
- Properties and characterizations of k ‐treesMathematika, 1971
- Graphs and k-SocietiesCanadian Mathematical Bulletin, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- How comprehensive is the category of semigroups?Journal of Algebra, 1969
- The Category of Graphs with a Given Subgraph-with Applications to Topology and AlgebraCanadian Journal of Mathematics, 1969
- Symmetric relations (undirected graphs) with given semigroupsMonatshefte für Mathematik, 1965