The following pages link to Regular graphs are antimagic (Q888592):
Displaying 22 items.
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- Antimagic orientation of subdivided caterpillars (Q832995) (← links)
- Lattice grids and prisms are antimagic (Q1022588) (← links)
- Antimagic orientation of biregular bipartite graphs (Q1676793) (← links)
- Lexicographic product graphs \(P_m[P_n]\) are antimagic (Q1713615) (← links)
- Partially magic labelings and the antimagic graph conjecture (Q1745194) (← links)
- Weighted antimagic labeling (Q1752499) (← links)
- A generalized version of a local antimagic labelling conjecture (Q1756104) (← links)
- Antimagic labeling of the lexicographic product graph \(K_{m,n}[P_k]\) (Q1993366) (← links)
- Antimagic orientations of graphs with large maximum degree (Q2005714) (← links)
- Antimagic labeling of biregular bipartite graphs (Q2112650) (← links)
- Stacked book graphs are cycle-antimagic (Q2132164) (← links)
- Caterpillars are antimagic (Q2223075) (← links)
- Local antimagic labeling of graphs (Q2423101) (← links)
- Antimagic orientations of graphs with given independence number (Q2659069) (← links)
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- List-antimagic labeling of vertex-weighted graphs (Q5024668) (← links)
- Multi-bridge graphs are anti-magic (Q5081233) (← links)
- (Q5869383) (← links)
- Antimagic orientation of graphs with minimum degree at least 33 (Q6056766) (← links)
- Graph antimagic labeling: a survey (Q6542943) (← links)
- On vertex in-out-antimagic total digraphs (Q6552596) (← links)
