Antimagic orientation of Halin graphs
From MaRDI portal
Publication:2324503
DOI10.1016/j.disc.2019.06.024zbMath1419.05191OpenAlexW2954176357WikidataQ127576597 ScholiaQ127576597MaRDI QIDQ2324503
Xiaowei Yu, Shan Zhou, Yu-Lin Chang
Publication date: 11 September 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.06.024
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Antimagic orientation of subdivided caterpillars ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ Antimagic orientation of lobsters ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labeling of biregular bipartite graphs
Cites Work
- Unnamed Item
- Anti-magic labeling of trees
- On zero-sum partitions and anti-magic trees
- Antimagic orientation of biregular bipartite graphs
- Local antimagic orientations of \(d\)-degenerate graphs
- 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
This page was built for publication: Antimagic orientation of Halin graphs