The following pages link to (Q3466244):
Displaying 14 items.
- Caterpillars with maximum degree 3 are antimagic (Q1999746) (← links)
- Shifted-antimagic labelings for graphs (Q2045398) (← 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)
- 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 new classes of trees (Q5016222) (← links)
- Labeling trees of small diameters with consecutive integers (Q6110572) (← links)
- Generation of anti-magic graphs from binary graph products (Q6138728) (← links)
- Graph antimagic labeling: a survey (Q6542943) (← links)
- Every graph is homeomorphic to an antimagic bipartite graph (Q6564831) (← links)
- On \(k\)-shifted antimagic spider forests (Q6611091) (← links)
- Antimagic labeling for subdivisions of graphs (Q6671398) (← links)