Full embeddings into some categories of graphs
From MaRDI portal
Publication:2559488
DOI10.1007/BF02945020zbMATH Open0257.05115MaRDI QIDQ2559488FDOQ2559488
Authors: Pavol Hell 
Publication date: 1972
Published in: Algebra Universalis (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structure theory of algebraic structures (08A05) Embedding theorems, universal categories (18B15)
Cites Work
- Title not available (Why is that?)
- On full embeddings of categories of algebras
- Symmetric relations (undirected graphs) with given semigroups
- Nonconstant Endomorphisms of Lattices
- How comprehensive is the category of semigroups?
- The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- Graphs and k-Societies
- Every finite graph is a full subgraph of a rigid graph
- Testing Categories and Strong Universality
Cited In (9)
- Group-universal unary varieties
- A note on finitely generated hopfian lattices
- Free products of hopfian lattices
- On some strongly rigid families of graphs and the full embeddings they induce
- Nonconstant Endomorphisms of Lattices
- Quotients of rigid graphs
- Homomorphisms of graphs and of their orientations
- Chromatic automorphisms of graphs
- Homomorphisms of bounded lattices with a given sublattice
This page was built for publication: Full embeddings into some categories of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2559488)
