Local antimagic labeling of graphs (Q2423101): 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 @@
+Local antimagic vertex coloring of a graph
@@ Property / cites work: Local antimagic vertex coloring of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Regular graphs are antimagic
@@ Property / cites work: Regular graphs are antimagic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / 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 @@
+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 @@
+Local antimagic orientations of \(d\)-degenerate graphs
+Normal rank
@@ Property / cites work @@
+Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
+Normal rank
@@ Property / cites work @@
+Neighbor sum distinguishing total colorings of planar graphs
+Normal rank
@@ Property / cites work @@
+Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
+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