Weighted antimagic labeling: an algorithmic approach (Q324749): Difference between revisions

@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+Dense graphs are antimagic
@@ Property / cites work: Dense graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice grids and prisms are antimagic
@@ Property / cites work: Lattice grids and prisms are antimagic / 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 @@
+Q3999001
@@ Property / cites work: Q3999001 / rank @@
+Normal rank
@@ Property / cites work @@
+Anti‐magic graphs via the Combinatorial NullStellenSatz
+Normal rank
@@ Property / cites work @@
+An Application of the combinatorial Nullstellensatz to a graph labelling problem
+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 @@
+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 @@
+Antimagic labelling of vertex weighted graphs
@@ Property / cites work: Antimagic labelling of vertex weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Antimagic Properties of Graphs with Large Maximum Degree
+Normal rank