Anti‐magic graphs via the Combinatorial NullStellenSatz

DOI10.1002/jgt.20112zbMath1076.05068OpenAlexW4230547233MaRDI QIDQ5711695

Dan Hefetz

Publication date: 8 December 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20112

zbMATH Keywords

labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (44)

Constructing integer-magic graphs via the Combinatorial Nullstellensatz ⋮ Antimagic labelling of vertex weighted graphs ⋮ On edge-graceful labeling and deficiency for regular graphs ⋮ Weighted antimagic labeling: an algorithmic approach ⋮ Antimagic Labeling of Regular Graphs ⋮ A new class of antimagic join graphs ⋮ 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 ⋮ 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 ⋮ Punctured combinatorial Nullstellensätze ⋮ Weighted-1-antimagic graphs of prime power order ⋮ A class of antimagic join graphs ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Caterpillars are antimagic ⋮ On anti-magic labeling for graph products ⋮ An antimagic labeling inK_2n,2n–nC₄ ⋮ Weighted antimagic labeling ⋮ Approximate results for rainbow labelings ⋮ Antimagic Properties of Graphs with Large Maximum Degree ⋮ Construction of antimagic labeling for the Cartesian product of regular graphs ⋮ Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) ⋮ Antimagic labelings of caterpillars ⋮ On antimagic directed graphs ⋮ An Application of the combinatorial Nullstellensatz to a graph labelling problem ⋮ 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 ⋮ The antimagicness of the Cartesian product of graphs ⋮ Shifted-antimagic labelings for graphs ⋮ Lattice grids and prisms are antimagic ⋮ Antimagic labeling of forests with sets of consecutive integers ⋮ A note on antimagic orientations of even regular graphs ⋮ On a conjecture of Graham and Häggkvist with the polynomial method ⋮ Antimagic orientation of Halin graphs ⋮ List-antimagic labeling of vertex-weighted graphs

This page was built for publication: Anti‐magic graphs via the Combinatorial NullStellenSatz