Regular Graphs of Odd Degree Are Antimagic (Q2947855): Difference between revisions

@@ Property / arXiv ID @@
+.4850
@@ Property / arXiv ID: 1303.4850 / rank @@
+Normal rank
@@ Property / cites work @@
+Dense graphs are antimagic
@@ Property / cites work: Dense graphs 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 @@
+Antimagic Labeling of Cubic Graphs
@@ Property / cites work: Antimagic Labeling of Cubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Antimagic Labeling of Odd Regular Graphs
@@ Property / cites work: On Antimagic Labeling of Odd Regular Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Antimagic Properties of Graphs with Large Maximum Degree
+Normal rank