Proof of a local antimagic conjecture
An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,E(G)\}$ such that the sums $S_v=\sum_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2$ admits an antimagic labelling. Recently, two s...
Main Author: | John Haslegrave |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2018-06-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3887/pdf |
Similar Items
-
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
by: Colin Defant
Published: (2019-10-01) -
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
by: Lau Gee-Choon, et al.
Published: (2021-02-01) -
Caterpillars Have Antimagic Orientations
by: Lozano Antoni
Published: (2018-12-01) -
Nonrepetitive edge-colorings of trees
by: A. Kündgen, et al.
Published: (2017-06-01) -
On harmonious coloring of hypergraphs
by: Sebastian Czerwiński
Published: (2024-07-01)