3 problems

Let $G$ be a connected undirected graph. An antimagic orientation consists of an orientation $D$ of $G$ and a bijection from $E(G)$ to $\{1,2,\ldots,|E(G)|\}$ such that the vertex…

Let $G$ be a connected undirected graph. An antimagic orientation of $G$ is an orientation of $G$ together with a bijection from its edges to $\{1,2,\ldots,|E(G)|\}$ such that the…

Let $G$ be a finite simple graph. An antimagic orientation of $G$ is an orientation $D$ whose arcs have a bijective labeling by $\{1,\ldots,|A(D)|\}$ with pairwise distinct vertex-…