On some strongly rigid families of graphs and the full embeddings they induce
From MaRDI portal
Publication:1214943
Cites work
- Any boundable binding category contains a proper class of mutually disjoint copies of itself
- Every finite graph is a full subgraph of a rigid graph
- Full embeddings into some categories of graphs
- Graphs and k-Societies
- How comprehensive is the category of semigroups?
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3297037 (Why is no real title available?)
- scientific article; zbMATH DE number 3404269 (Why is no real title available?)
- scientific article; zbMATH DE number 3031989 (Why is no real title available?)
- On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
- Properties and characterizations of k ‐trees
- Symmetric relations (undirected graphs) with given semigroups
- The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
Cited in
(7)- A surprising permanence of old motivations (a not-so-rigid story)
- Homomorphisms of 3-chromatic graphs
- On multiplicative graphs and the product conjecture
- On semigroups of graph endomorphisms
- Homomorphisms of graphs and of their orientations
- Endomorphisms of graphs. I: The monoid of strong endomorphisms
- Endomorphism spectra of graphs
This page was built for publication: On some strongly rigid families of graphs and the full embeddings they induce
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1214943)
