Graphs admitting antimagic labeling for arbitrary sets of positive numbers
From MaRDI portal
Publication:2184690
Recommendations
Cites work
- scientific article; zbMATH DE number 6537750 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- Anti-magic labeling of trees
- Antimagic labeling and canonical decomposition of graphs
- Antimagic labeling graphs with a regular dominating subgraph
- Antimagic labeling of cubic graphs
- Antimagic labeling of regular graphs
- Antimagic labelling of vertex weighted graphs
- Anti‐magic graphs via the Combinatorial NullStellenSatz
- Computing and Combinatorics
- Dense graphs are antimagic
- Lattice grids and prisms are antimagic
- On anti-magic labeling for graph products
- Regular bipartite graphs are antimagic
- Regular graphs of odd degree are antimagic
- Weighted antimagic labeling
Cited in
(5)
This page was built for publication: Graphs admitting antimagic labeling for arbitrary sets of positive numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184690)