×

Every finite graph is a full subgraph of a rigid graph. (English) Zbl 0231.05107


MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Harary, F., (Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, Mass) · Zbl 0182.57702
[2] Hedrlín, Z.; Pultr, A., Symmetric relations (undirected graphs) with given semigroups, Monatsh. Math., 69, 318-322 (1965) · Zbl 0139.24803
[3] Hedrlín, Z.; Pultr, A., On full embeddings of categories of algebras, Illinois J. Math., 10, 392-406 (1966) · Zbl 0139.01501
[4] Hedrlín, Z.; Pultr, A., On rigid undirected graphs, Canad. J. Math., 18, 1237-1242 (1966) · Zbl 0145.20603
[5] E. MendelsohnArch. Math. (Basel); E. MendelsohnArch. Math. (Basel)
[6] Vopěnka, P.; Pultr, A.; Hedrlín, Z., A rigid relation exists on any set, Comment. Math. Univ. Carolinae, 6, 149-155 (1965) · Zbl 0149.01402
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.