Pages that link to "Item:Q1999746"
From MaRDI portal
The following pages link to Caterpillars with maximum degree 3 are antimagic (Q1999746):
Displaying 8 items.
- Trees whose even-degree vertices induce a path are antimagic (Q2151224) (← links)
- Antimagic labeling of some biregular bipartite graphs (Q2158199) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- List-antimagic labeling of vertex-weighted graphs (Q5024668) (← 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)
