On recognizing graphs by numbers of homomorphisms (Q3057061): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20461
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20461 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2524594508
@@ Property / OpenAlex ID: W2524594508 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal lower bound on the number of variables for graph identification
+Normal rank
@@ Property / cites work @@
+-transitive graphs
@@ Property / cites work: 6-transitive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Distinguishing graphs by the number of homomorphisms
+Normal rank
@@ Property / cites work @@
+Operations with structures
@@ Property / cites work: Operations with structures / rank @@
+Normal rank
@@ Property / cites work @@
+Contractors and connectors of graph algebras
@@ Property / cites work: Contractors and connectors of graph algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time low tree-width partitions and algorithmic consequences
+Normal rank