Antimagic orientations of graphs with large maximum degree

DOI10.1016/j.disc.2020.112123zbMath1448.05178arXiv1908.06072OpenAlexW3082929499MaRDI QIDQ2005714

Zi-Xia Song, K. E. Perry, Andrew Owens, Donglei Yang, Joshua Carlson, Fangfang Zhang, Inne Singgih, Xiao-Hong Zhang

Publication date: 8 October 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.06072

zbMATH Keywords

antimagic labelingEuler tourantimagic orientation

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Antimagic orientation of subdivided caterpillars ⋮ Antimagic orientations of graphs with given independence number ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Antimagic labeling of biregular bipartite graphs

Cites Work

• Unnamed Item
• Regular graphs are antimagic
• Antimagic orientation of biregular bipartite graphs
• A note on antimagic orientations of even regular graphs
• Antimagic orientation of Halin graphs
• Graphs of Large Linear Size Are Antimagic
• Regular Graphs of Odd Degree Are Antimagic
• On antimagic directed graphs
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• Antimagic Properties of Graphs with Large Maximum Degree
• Antimagic orientations of even regular graphs

This page was built for publication: Antimagic orientations of graphs with large maximum degree