Every connected graph G with |G| >= 9 and Delta(G) >= |G| - 5 has an antimagic orientation.
Cranston, Regular bipartite graphs are antimagic, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Antimagic orientations of graphs with large maximum degree
Every connected graph G with |G| >= 9 and Delta(G) >= |G| - 5 has an antimagic orientation.