On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs (Q3000511): Difference between revisions

@@ Property / cites work @@
+Dense graphs are antimagic
@@ Property / cites work: Dense graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+A new class of antimagic Cartesian product graphs
@@ Property / cites work: A new class of antimagic Cartesian product graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Regular bipartite graphs are antimagic
@@ Property / cites work: Regular bipartite graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem concerning separating systems of a finite set
+Normal rank
@@ Property / cites work @@
+A dynamic survey of graph labeling
@@ Property / cites work: A dynamic survey of graph labeling / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999001
@@ Property / cites work: Q3999001 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3058986
@@ Property / cites work: Q3058986 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4876748
@@ Property / cites work: Q4876748 / rank @@
+Normal rank
@@ Property / cites work @@
+Completely separating systems of \(k\)-sets
@@ Property / cites work: Completely separating systems of \(k\)-sets / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+On anti-magic labeling for graph products
@@ Property / cites work: On anti-magic labeling for graph products / rank @@
+Normal rank
@@ Property / cites work @@
+The antimagicness of the Cartesian product of graphs
+Normal rank