Dense graphs are antimagic
From MaRDI portal
Publication:3159384
DOI10.1002/jgt.20027zbMath1055.05132arXivmath/0304198OpenAlexW2949865692MaRDI QIDQ3159384
Gil Kaplan, Arieh Lev, Raphael Yuster, Noga Alon, Yehuda Roditty
Publication date: 16 February 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0304198
Related Items (70)
Antimagic orientation of subdivided caterpillars ⋮ Antimagic labelling of vertex weighted graphs ⋮ Weighted antimagic labeling: an algorithmic approach ⋮ Antimagic Labeling of Regular Graphs ⋮ Unnamed Item ⋮ Antimagic labeling of some biregular bipartite graphs ⋮ Multi-bridge graphs are anti-magic ⋮ 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 ⋮ On edge-graceful regular graphs with particular 3-factors ⋮ Regular Graphs of Odd Degree Are Antimagic ⋮ Graphs admitting antimagic labeling for arbitrary sets of positive numbers ⋮ On antimagic labeling of regular graphs with particular factors ⋮ Anti-magic labeling of trees ⋮ Antimagic orientation of graphs with minimum degree at least 33 ⋮ Antimagic orientation of forests ⋮ Local antimagic labeling of graphs ⋮ Labeling trees of small diameters with consecutive integers ⋮ Generation of anti-magic graphs from binary graph products ⋮ Vertex-antimagic labelings of regular graphs ⋮ Approaches that output infinitely many graphs with small local antimagic chromatic number ⋮ Finding Antimagic Labelings of Trees by Evolutionary Search ⋮ Weighted-1-antimagic graphs of prime power order ⋮ A class of antimagic join graphs ⋮ Antimagic labeling for unions of graphs with many three-paths ⋮ Antimagic labeling of generalized pyramid graphs ⋮ Lexicographic product graphs \(P_m[P_n\) are antimagic] ⋮ Antimagic labeling graphs with a regular dominating subgraph ⋮ Unnamed Item ⋮ Caterpillars are antimagic ⋮ On anti-magic labeling for graph products ⋮ Local antimagic orientations of \(d\)-degenerate graphs ⋮ On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs ⋮ An antimagic labeling inK2n,2n–nC4 ⋮ Partially magic labelings and the antimagic graph conjecture ⋮ Bertrand's postulate, the prime number theorem and product anti-magic graphs ⋮ Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k\)] ⋮ Weighted antimagic labeling ⋮ Approximate results for rainbow labelings ⋮ Antimagic Properties of Graphs with Large Maximum Degree ⋮ A generalized version of a local antimagic labelling conjecture ⋮ Characterization of product anti-magic graphs of large order ⋮ Caterpillars with maximum degree 3 are antimagic ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Antimagic orientations of graphs with large maximum degree ⋮ Antimagic labelings of caterpillars ⋮ Labelings of plane graphs containing Hamilton path ⋮ Antimagicness of generalized corona and snowflake graphs ⋮ Antimagicness of lexicographic product graph \(G[P_n\)] ⋮ On antimagic directed graphs ⋮ An Application of the combinatorial Nullstellensatz to a graph labelling problem ⋮ Antimagic orientations for the complete \(k\)-ary trees ⋮ Antimagic labeling and canonical decomposition of graphs ⋮ Regular bipartite graphs are antimagic ⋮ A new class of antimagic Cartesian product graphs ⋮ Graphs of Large Linear Size Are Antimagic ⋮ Antimagic labelings of join graphs ⋮ The antimagicness of the Cartesian product of graphs ⋮ Shifted-antimagic labelings for graphs ⋮ Lattice grids and prisms are antimagic ⋮ On zero-sum partitions and anti-magic trees ⋮ Antimagic labeling of forests with sets of consecutive integers ⋮ Antimagic orientations of disconnected even regular graphs ⋮ A note on antimagic orientations of even regular graphs ⋮ Antimagic orientation of Halin graphs ⋮ On \((a, 1)\)-vertex-antimagic edge labeling of regular graphs ⋮ Antimagic Labeling of Cubic Graphs ⋮ Antimagic labeling of biregular bipartite graphs
Cites Work
This page was built for publication: Dense graphs are antimagic
