Caterpillars with maximum degree 3 are antimagic

DOI10.1016/j.disc.2019.02.021zbMath1414.05255OpenAlexW2921294556MaRDI QIDQ1999746

Yunfei Li, Kecai Deng

Publication date: 27 June 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.02.021

zbMATH Keywords

caterpillarantimagic labeling

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

Trees whose even-degree vertices induce a path are antimagic ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ Antimagic labeling for unions of graphs with many three-paths ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ List-antimagic labeling of vertex-weighted graphs

Cites Work

• Anti-magic labeling of trees
• On zero-sum partitions and anti-magic trees
• A dynamic survey of graph labeling
• Antimagic labelings of caterpillars
• Graphs of Large Linear Size Are Antimagic
• Antimagic Labeling of Cubic Graphs
• Regular Graphs of Odd Degree Are Antimagic
• Dense graphs are antimagic
• Antimagic Labeling of Regular Graphs
• Regular bipartite graphs are antimagic
• Unnamed Item
• Unnamed Item

This page was built for publication: Caterpillars with maximum degree 3 are antimagic