Antimagic Properties of Graphs with Large Maximum Degree
From MaRDI portal
Publication:4916097
DOI10.1002/jgt.21664zbMath1261.05092OpenAlexW1589189947MaRDI QIDQ4916097
Publication date: 19 April 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21664
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07)
Related Items
On edge-graceful labeling and deficiency for regular graphs, Weighted antimagic labeling: an algorithmic approach, Antimagic orientations of graphs with given independence number, Local antimagic orientation of graphs, Antimagic orientation of biregular bipartite graphs, Graphs admitting antimagic labeling for arbitrary sets of positive integers, Regular Graphs of Odd Degree Are Antimagic, Antimagic orientation of graphs with minimum degree at least 33, Antimagic orientation of forests, Local antimagic labeling of graphs, Caterpillars are antimagic, Local antimagic orientations of \(d\)-degenerate graphs, Weighted antimagic labeling, A generalized version of a local antimagic labelling conjecture, Antimagic orientations of graphs with large maximum degree, Antimagic labelings of caterpillars, Antimagic orientation of Halin graphs, List-antimagic labeling of vertex-weighted graphs, Antimagic labeling of biregular bipartite graphs
Cites Work
