Antimagic orientation of forests

DOI10.1016/j.disc.2023.113666zbMath1529.05137arXiv2111.03809MaRDI QIDQ6080125

Xiaowei Yu, Songling Shan

Publication date: 30 October 2023

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

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

zbMATH Keywords

labelingforestantimagic labelingantimagic orientation

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Anti-magic labeling of trees
• Antimagic orientation of subdivided caterpillars
• On zero-sum partitions and anti-magic trees
• A dynamic survey of graph labeling
• Antimagic orientation of biregular bipartite graphs
• Antimagic orientation of lobsters
• Antimagic orientations of graphs with large maximum degree
• Trees whose even-degree vertices induce a path are antimagic
• Antimagic labeling of some biregular bipartite graphs
• Caterpillars are antimagic
• A note on antimagic orientations of even regular graphs
• Antimagic orientation of Halin graphs
• Antimagic orientations of graphs with given independence number
• Graphs of Large Linear Size Are Antimagic
• Regular Graphs of Odd Degree Are Antimagic
• On antimagic directed graphs
• An Application of the combinatorial Nullstellensatz to a graph labelling problem
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• Antimagic Properties of Graphs with Large Maximum Degree
• Caterpillars Have Antimagic Orientations
• Antimagic orientations of even regular graphs
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Antimagic orientation of graphs with minimum degree at least 33

This page was built for publication: Antimagic orientation of forests