The following pages link to Anti-magic labeling of trees (Q397133):
Displaying 32 items.
- Regular sparse anti-magic squares with small odd densities (Q501042) (← links)
- Antimagic orientation of subdivided caterpillars (Q832995) (← links)
- Lexicographic product graphs \(P_m[P_n]\) are antimagic (Q1713615) (← links)
- Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← links)
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\) (Q1993366) (← links)
- Caterpillars with maximum degree 3 are antimagic (Q1999746) (← links)
- Antimagic orientation of lobsters (Q2004070) (← links)
- Antimagic labelings of caterpillars (Q2008558) (← links)
- Antimagicness of lexicographic product graph \(G[P_n]\) (Q2023731) (← links)
- Shifted-antimagic labelings for graphs (Q2045398) (← links)
- Product antimagic labeling of caterpillars (Q2051631) (← links)
- Antimagic labeling of forests with sets of consecutive integers (Q2065767) (← links)
- On the existence of regular sparse anti-magic squares of odd order (Q2115166) (← links)
- Trees whose even-degree vertices induce a path are antimagic (Q2151224) (← links)
- Antimagic labeling of some biregular bipartite graphs (Q2158199) (← links)
- Graphs admitting antimagic labeling for arbitrary sets of positive numbers (Q2184690) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Antimagic orientation of Halin graphs (Q2324503) (← links)
- Graphs admitting antimagic labeling for arbitrary sets of positive integers (Q2413165) (← links)
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- Antimagic Labeling of Cubic Graphs (Q2874087) (← links)
- Antimagic Labeling of Regular Graphs (Q3188668) (← links)
- ON LOCAL ANTIMAGIC CHROMATIC NUMBER OF GRAPHS (Q4956449) (← links)
- Antimagic labeling of new classes of trees (Q5016222) (← links)
- Local antimagic chromatic number for the corona product of wheel and null graphs (Q5052966) (← links)
- Local vertex antimagic chromatic number of some wheel related graphs (Q5065628) (← links)
- Multi-bridge graphs are anti-magic (Q5081233) (← links)
- Constructions of regular sparse anti-magic squares (Q5089691) (← links)
- Antimagic orientation of forests (Q6080125) (← links)
- Labeling trees of small diameters with consecutive integers (Q6110572) (← links)
- Generation of anti-magic graphs from binary graph products (Q6138728) (← links)
- The existence spectrum for regular sparse anti-magic squares (Q6172280) (← links)
