Every finite graph is a full subgraph of a rigid graph (Q2550402): Difference between revisions

@@ Property / author @@
-Q790131
@@ Property / author: Q790131 / rank @@
-Normal rank
@@ Property / author @@
-Luděk Kučera
@@ Property / author: Luděk Kučera / rank @@
-Normal rank
@@ Property / author @@
+Pavol Hell
@@ Property / author: Pavol Hell / rank @@
+Normal rank
@@ Property / author @@
+Luděk Kučera
@@ Property / author: Luděk Kučera / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(71)90038-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1974819867
@@ Property / OpenAlex ID: W1974819867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric relations (undirected graphs) with given semigroups
+Normal rank
@@ Property / cites work @@
+On full embeddings of categories of algebras
@@ Property / cites work: On full embeddings of categories of algebras / rank @@
+Normal rank
@@ Property / cites work @@
+On Rigid Undirected Graphs
@@ Property / cites work: On Rigid Undirected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5527830
@@ Property / cites work: Q5527830 / rank @@
+Normal rank