2018/11/05 by Donglei Yang, Yang, Donglei
Computer Science · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.1811.01904
openalex publication_date 2018/11/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Motivated by the conjecture of Hartsfield and Ringel on antimagic labelings of undirected graphs, Hefetz, Mütze, and Schwartz initiated the study of antimagic labelings of digraphs in 2010. Very recently, it has been conjectured in [Antimagic orientation of even regular graphs, J. Graph Theory, 90 (2019), 46-53.] that every graph admits an antimagtic orientation, which is a strengthening of an earlier conjecture of Hefetz, Mütze and Schwartz. In this paper, we prove that every 2d-regular graph (not necessarily connected) admits an antimagic orientation, where d≥2. Together with known results, our main result implies that the above-mentioned conjecture is true for all regular graphs.