2 problems

Let $T$ be a tree of order $n$, and let $P_n$ denote the path on $n$ vertices. Path extremal conjecture. The game cordiality number satisfies … This conjecture proposes that paths…

A graph $G$ is 3-cordial if its vertices are labeled by $0$, $1$, and $2$ with label-class sizes differing by at most one, and each edge receives the sum of its endpoint labels mod…