Graph antimagic labeling: a survey
From MaRDI portal
Publication:6542943
Recommendations
Cites work
- A class of antimagic join graphs
- A new class of antimagic Cartesian product graphs
- A note on antimagic orientations of even regular graphs
- Anti-magic labeling of trees
- Anti-magic labelling of Cartesian product of graphs
- Antimagic labeling of cubic graphs
- Antimagic labeling of digraphs
- Antimagic labeling of forests with sets of consecutive integers
- Antimagic labeling of linear forests
- Antimagic labeling of new classes of trees
- Antimagic labeling of regular graphs
- Antimagic labeling of some biregular bipartite graphs
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\)
- Antimagic labelings of cycle powers.
- Antimagic labelings of join graphs
- Antimagic labelling of vertex weighted graphs
- Antimagic orientation of biregular bipartite graphs
- Antimagic orientation of graphs with minimum degree at least 33
- Antimagic orientation of Halin graphs
- Antimagic orientation of lobsters
- Antimagic orientation of subdivided caterpillars
- Antimagic orientations for the complete \(k\)-ary trees
- Antimagic orientations of even regular graphs
- Antimagic orientations of graphs with given independence number
- Antimagic orientations of graphs with large maximum degree
- Antimagic properties of graphs with large maximum degree
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Caterpillars are antimagic
- Caterpillars have antimagic orientations
- Caterpillars with maximum degree 3 are antimagic
- Combinatorial Nullstellensatz
- Dense graphs are antimagic
- Graphs of large linear size are antimagic
- scientific article; zbMATH DE number 6712556 (Why is no real title available?)
- scientific article; zbMATH DE number 6537750 (Why is no real title available?)
- scientific article; zbMATH DE number 1944626 (Why is no real title available?)
- scientific article; zbMATH DE number 2107985 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Local antimagic labeling of graphs
- Local antimagic orientation of graphs
- Local antimagic orientations of \(d\)-degenerate graphs
- Local antimagic vertex coloring of a graph
- On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
- On anti-magic labeling for graph products
- On antimagic directed graphs
- On antimagic labeling for generalized web and flower graphs
- On antimagic labeling of odd regular graphs
- On the antimagic labeling of star forests
- On zero-sum partitions and anti-magic trees
- Proof of a local antimagic conjecture
- Regular bipartite graphs are antimagic
- Regular graphs are antimagic
- Regular graphs of odd degree are antimagic
- Shifted-antimagic labelings for graphs
- Trees whose even-degree vertices induce a path are antimagic
- Weighted antimagic labeling
- Weighted-1-antimagic graphs of prime power order
Cited in
(2)
This page was built for publication: Graph antimagic labeling: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542943)