On some strongly rigid families of graphs and the full embeddings they induce
From MaRDI portal
Publication:1214943
DOI10.1007/BF02485713zbMath0299.05109MaRDI QIDQ1214943
Publication date: 1974
Published in: Algebra Universalis (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structure theory of algebraic structures (08A05) Directed graphs (digraphs), tournaments (05C20) Embedding theorems, universal categories (18B15)
Related Items
On multiplicative graphs and the product conjecture ⋮ On semigroups of graph endomorphisms ⋮ Endomorphism spectra of graphs ⋮ Homomorphisms of graphs and of their orientations ⋮ Endomorphisms of graphs. I: The monoid of strong endomorphisms ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Homomorphisms of 3-chromatic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric relations (undirected graphs) with given semigroups
- How comprehensive is the category of semigroups?
- Every finite graph is a full subgraph of a rigid graph
- Any boundable binding category contains a proper class of mutually disjoint copies of itself
- Full embeddings into some categories of graphs
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
- Graphs and k-Societies
- Properties and characterizations of k ‐trees
