6 problems

Let $G$ be a finite, simple, undirected graph. A graph is $C$-antimagic if it admits an edge labelling whose vertex sums have at most $C$ conflicts, as defined in the paper. $C$-an…

Let $P_3$ be the path on three vertices. For a graph $H$, a $(1,1)$-antimagic labeling is an antimagic labeling whose vertex sums are exactly $1,2,\ldots,|V(H)|$. Pell-equation exi…

Let $G$ be a graph, let $P_3$ be the path on three vertices, and let $\tau(G)$ be the maximum integer such that the disjoint union of $G$ and $c$ copies of $P_3$ is antimagic for e…

Let $G=(V,E)$ be a finite simple undirected graph without isolated vertices. A super vertex total local antimagic labeling is a bijection $f:V\cup E\to\{1,2,\dots,|V|+|E|\}$ satisf…

Let $T$ be a tree. An antimagic labeling of $T$ is a bijection $f:E(T)\to\{1,\ldots,|E(T)|\}$ such that the vertex weights … are distinct for every pair of distinct vertices…

Let $G$ be a connected graph. An antimagic labeling of $G$ is a bijection $f:E(G)\to\{1,\ldots,|E(G)|\}$ such that the vertex weights … are distinct for every pair of distinct vert…