The following pages link to Dense graphs are antimagic (Q3159384):
Displaying 27 items.
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- Graphs of large linear size are antimagic (Q2800541) (← links)
- Antimagic labeling of cubic graphs (Q2874087) (← links)
- Antimagic labelling of vertex weighted graphs (Q2897212) (← links)
- Regular Graphs of Odd Degree Are Antimagic (Q2947855) (← links)
- On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs (Q3000511) (← links)
- An antimagic labeling in<i>K</i><sub>2n,2n</sub>–<i>nC</i><sub>4</sub> (Q3005871) (← links)
- On antimagic directed graphs (Q3055919) (← links)
- An Application of the combinatorial Nullstellensatz to a graph labelling problem (Q3055927) (← links)
- Antimagic Labeling of Regular Graphs (Q3188668) (← links)
- Regular bipartite graphs are antimagic (Q3608318) (← links)
- (Q4691889) (← links)
- Antimagic Properties of Graphs with Large Maximum Degree (Q4916097) (← links)
- Multi-bridge graphs are anti-magic (Q5081233) (← links)
- (Q5869383) (← links)
- Antimagic orientation of graphs with minimum degree at least 33 (Q6056766) (← 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)
- Approaches that output infinitely many graphs with small local antimagic chromatic number (Q6174162) (← links)
- Graph antimagic labeling: a survey (Q6542943) (← links)
- On vertex in-out-antimagic total digraphs (Q6552596) (← links)
- On local antimagic chromatic number of cycle-related join graphs. II (Q6560771) (← links)
- Antimagic labeling for some snake graphs (Q6563275) (← links)
- On \(k\)-shifted antimagic spider forests (Q6611091) (← links)
- Antimagicness of tensor product for some wheel related graphs with star (Q6651094) (← links)
- Antimagic labeling for subdivisions of graphs (Q6671398) (← links)
