Cartesian powers of graphs can be distinguished by two labels (Q854831): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2005.07.001
@@ Property / DOI: 10.1016/j.ejc.2005.07.001 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejc.2005.07.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2045398969
@@ Property / OpenAlex ID: W2045398969 / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing Cartesian powers of graphs
@@ Property / cites work: Distinguishing Cartesian powers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry breaking in graphs
@@ Property / cites work: Symmetry breaking in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The distinguishing number of the hypercube
@@ Property / cites work: The distinguishing number of the hypercube / rank @@
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+Associative products of graphs
@@ Property / cites work: Associative products of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the asymptotic and computational complexity of graph distinguishability
+Normal rank
@@ Property / cites work @@
+Graph multiplication
@@ Property / cites work: Graph multiplication / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2005.07.001
@@ Property / DOI: 10.1016/J.EJC.2005.07.001 / rank @@
+Normal rank