Multi-bridge graphs are anti-magic (Q5081233): Difference between revisions

@@ Property / cites work @@
+Dense graphs are antimagic
@@ Property / cites work: Dense graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+Regular graphs are antimagic
@@ Property / cites work: Regular graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+Antimagic Labeling of Regular Graphs
@@ Property / cites work: Antimagic Labeling of Regular 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 @@
+Regular Graphs of Odd Degree Are Antimagic
@@ Property / cites work: Regular Graphs of Odd Degree Are Antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999001
@@ Property / cites work: Q3999001 / rank @@
+Normal rank
@@ Property / cites work @@
+On zero-sum partitions and anti-magic trees
@@ Property / cites work: On zero-sum partitions and anti-magic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-magic labeling of trees
@@ Property / cites work: Anti-magic labeling of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank