Local antimagic labeling of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- A dynamic survey of graph labeling
- Antimagic labelling of vertex weighted graphs
- Antimagic properties of graphs with large maximum degree
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Combinatorial Nullstellensatz
- Dense graphs are antimagic
- Graph theory with applications
- Local antimagic orientations of \(d\)-degenerate graphs
- Local antimagic vertex coloring of a graph
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Neighbor sum distinguishing total colorings of planar graphs
- Regular bipartite graphs are antimagic
- Regular graphs are antimagic
- Regular graphs of odd degree are antimagic
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
Cited in
(14)- On local antimagic chromatic number of cycle-related join graphs
- On local antimagic total labeling of complete graphs amalgamation
- Local antimagic orientations of \(d\)-degenerate graphs
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- Product antimagic labeling of caterpillars
- A generalized version of a local antimagic labelling conjecture
- Antimagic orientation of lobsters
- On local antimagic chromatic number of various join graphs
- Every graph is local antimagic total and its applications
- Approaches that output infinitely many graphs with small local antimagic chromatic number
- Antimagic labeling of cubic graphs
- A note on additive choice number of planar graphs
- Proof of a local antimagic conjecture
- Graph antimagic labeling: a survey
This page was built for publication: Local antimagic labeling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423101)