Local antimagic orientations of \(d\)-degenerate graphs

DOI10.1016/J.DAM.2018.10.012zbMath1406.05088OpenAlexW2898711761MaRDI QIDQ1730236

Jie Hu, Qiancheng Ouyang, Guang-Hui Wang

Publication date: 11 March 2019

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.012

zbMATH Keywords

combinatorial nullstellensatzdegenerate graphlocal antimagic orientation

Mathematics Subject Classification ID

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

Related Items (2)

Local antimagic labeling of graphs ⋮ Antimagic orientation of Halin graphs

Cites Work

• Unnamed Item
• Anti-magic labeling of trees
• Digraphs are 2-weight choosable
• Coloring chip configurations on graphs and digraphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Antimagic orientation of biregular bipartite graphs
• Edge weights and vertex colours
• The number of edge 3-colorings of a planar cubic graph as a permanent
• Local antimagic orientation of graphs
• Graphs of Large Linear Size Are Antimagic
• On antimagic directed graphs
• Dense graphs are antimagic
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
• Proof of a local antimagic conjecture
• Antimagic Properties of Graphs with Large Maximum Degree

This page was built for publication: Local antimagic orientations of \(d\)-degenerate graphs