Lattice grids and prisms are antimagic
Theoretical Computer Science
The antimagicness of the Cartesian product of graphs
Theoretical Computer Science
On a conjecture of Graham and Häggkvist with the polynomial method
European Journal of Combinatorics
Antimagic labeling and canonical decomposition of graphs
Information Processing Letters
On two generalizations of the Alon-Tarsi polynomial method
Journal of Combinatorial Theory Series B
Antimagic labelling of vertex weighted graphs
Journal of Graph Theory
On antimagic labeling of regular graphs with particular factors
Journal of Discrete Algorithms
| Hi-index | 0.00 |
An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it has an antimagic labeling. In [10], Ringel conjectured that every simple connected graph, other than K2, is antimagic. We prove several special cases and variants of this conjecture. Our main tool is the Combinatorial NullStellenSatz (cf. [1]). © 2005 Wiley Periodicals, Inc. J Graph Theory This paper is a part of the author's Ph.D. under the supervision of Prof. Michael Krivelevich.