An Application of the combinatorial Nullstellensatz to a graph labelling problem (Q3055927): Difference between revisions

@@ Property / cites work @@
+Dense graphs are antimagic
@@ Property / cites work: Dense graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Taking Integer Values
@@ Property / cites work: A Polynomial Taking Integer Values / 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 @@
+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 @@
+Anti‐magic graphs via the Combinatorial NullStellenSatz
+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 @@
+An Application of the combinatorial Nullstellensatz to a graph labelling problem
+Normal rank
@@ Property / cites work @@
+The number of edge 3-colorings of a planar cubic graph as a permanent
+Normal rank