On some strongly rigid families of graphs and the full embeddings they induce
type: Item
instance of: scholarly article
title: On some strongly rigid families of graphs and the full embeddings they induce
zbMATH Open document ID: 0299.05109
DOI: 10.1007/BF02485713
author: Pavol Hell
published in: Algebra Universalis
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 18B15
Mathematics Subject Classification ID: 08A05
zbMATH DE Number: 3468886
MaRDI profile type: Publication
cites work: Properties and characterizations of k ‐trees
cites work: Every finite graph is a full subgraph of a rigid graph
cites work: Q5572939
cites work: Q5771659
cites work: How comprehensive is the category of semigroups?
cites work: The Category of Graphs with a Given Subgraph-with Applications to Topology and Algebra
cites work: Symmetric relations (undirected graphs) with given semigroups
cites work: Any boundable binding category contains a proper class of mutually disjoint copies of itself
cites work: Full embeddings into some categories of graphs
cites work: Graphs and k-Societies
cites work: On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
cites work: Q5580179
cites work: Q5670650
description: scientific article; zbMATH DE number 3468886