Antimagic labeling for subdivisions of graphs
From MaRDI portal
(Redirected from Antimagic labeling for subdivisions of graphs)
Cites work
- A dynamic survey of graph labeling
- Anti-magic labeling of trees
- Antimagic labeling of biregular bipartite graphs
- Antimagic labeling of linear forests
- Antimagic labeling of regular graphs
- Antimagic labeling of some biregular bipartite 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 orientations of disconnected even regular graphs
- Antimagic orientations of even regular graphs
- Antimagic orientations of graphs with given independence number
- Dense graphs are antimagic
- scientific article; zbMATH DE number 6537750 (Why is no real title available?)
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- On antimagic directed graphs
- Shifted-antimagic labelings for graphs
- The strongly antimagic labelings of double spiders
Cited in
(2)
This page was built for publication: Antimagic labeling for subdivisions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671398)