A labeling f of a graph G is a bijection from its edge set
that every connected graph other than Ko is antimagic. In this paper, we show that some graphs with regular subgraphs are antimagic.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.