zbMATH — the first resource for mathematics

Full embeddings into some categories of graphs. (English) Zbl 0257.05115

05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
08A05 Structure theory of algebraic structures
18B15 Embedding theorems, universal categories
05C15 Coloring of graphs and hypergraphs
Full Text: DOI
[1] V. Chvátal, P. Hell, L. Kučera and J. Nešetřil,Every graph is a full subgraph of a rigid graph, Jour. Comb. Theory11 (1971), 284–286. · Zbl 0231.05107 · doi:10.1016/0095-8956(71)90038-4
[2] Z. Hedrlín and E. Mendelsohn,The category of graphs with a given subgraph–with applications to topology and algebra, Can. J. Math.21 (1969), 1506–1517. · Zbl 0196.03702 · doi:10.4153/CJM-1969-165-5
[3] Z. Hedrlín and J. Lambek,How comprehensive is the category of semigroups?, Journal of Algebra11 (1969), 195–212. · Zbl 0206.02505 · doi:10.1016/0021-8693(69)90054-4
[4] Z. Hedrlín and A. Pultr,On full embeddings of categories of algebras, Illinois Jour. of Math.10 (1966), 392–405. · Zbl 0139.01501
[5] Z. Heldrlín and A. Pultr,Symmetric relations (undirected graphs) with given semigroup, Mhf. für Math.68 (1965) 318–322. · Zbl 0139.24803
[6] Z. Hedrlín and others,A treatment, to appear, on approximate homomorphisms
[7] P. Hell,Fragile graphs and some other full embeddings, (to appear)
[8] P. Hell and J. Nešetřil,Graphs andk-societies, Can. Math. Bull.13 (1970), 375–381. · Zbl 0209.32201 · doi:10.4153/CMB-1970-071-3
[9] E. Mendelsohn,On a technique for representing semigroups as endomorphism semigroups of graphs with given properties, (to appear in Semigroup Forum). · Zbl 0262.20083
[10] B. Mitchell,Theory of categories, (Academic Press, N. Y. and London, 1965). · Zbl 0136.00604
[11] J. Sichler,Non constant endomorphism of lattices, (to appear). · Zbl 0249.06003
[12] J. Sichler,Testing categories and strong universality, (to appear). · Zbl 0265.18006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.