An application of the combinatorial nullstellensatz to a graph labelling problem

DOI10.1002/JGT.20466MaRDI QIDQ3055927zbMATH OpenOpenAlexFDO

Authors Dan Hefetz, Annina Saluz, Huong Tran

Publication date 10 November 2010

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

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

zbMATH Keywords

combinatorial nullstellensatzgraph labelling

Mathematics Subject Classification ID

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

Recommendations

• Anti‐magic graphs via the Combinatorial NullStellenSatz
• An antimagic labeling in \(K_{2n,2n} - nC_4\)
• Dense graphs are antimagic
• On antimagic labeling of regular graphs with particular factors
• On antimagic labeling of odd regular graphs

Cites work

• A dynamic survey of graph labeling
• A Polynomial Taking Integer Values
• An application of the combinatorial nullstellensatz to a graph labelling problem
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Dense graphs are antimagic
• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• On zero-sum partitions and anti-magic trees
• Regular bipartite graphs are antimagic
• The number of edge 3-colorings of a planar cubic graph as a permanent

Cited in

(26)

• Antimagic orientation of biregular bipartite graphs
• Weighted antimagic labeling
• Local antimagic orientation of graphs
• A note on antimagic orientations of even regular graphs
• Antimagic orientation of Halin graphs
• Graphs of large linear size are antimagic
• Antimagic labelling of vertex weighted graphs
• Regular graphs of odd degree are antimagic
• On antimagic directed graphs
• An application of the combinatorial nullstellensatz to a graph labelling problem
• Weighted antimagic labeling: an algorithmic approach
• On antimagic labeling of regular graphs with particular factors
• Weighted-1-antimagic graphs of prime power order
• Antimagic properties of graphs with large maximum degree
• scientific article; zbMATH DE number 7491440 (Why is no real title available?)
• Anti‐magic graphs via the Combinatorial NullStellenSatz
• Combinatorial Nullstellensatz
• Antimagic orientation of graphs with minimum degree at least 33
• Antimagic orientation of forests
• Every graph is homeomorphic to an antimagic bipartite graph
• Graceful antimagic injection via combinatorial nullstellensatz
• Antimagic and product antimagic graphs with pendant edges
• D-antimagic labelings arising from completely separating systems
• Antimagic labeling of subdivided caterpillars
• Beyond biregular: antimagicness of uni-regular bipartite graphs
• Bipartite graphs with minimum degree at least 15 are antimagic

This page was built for publication: An application of the combinatorial nullstellensatz to a graph labelling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055927)