1 problem

A family of graphs is weakly $A$-cordial if all but finitely many of its elements are $A$-cordial, where $A$ is an abelian group. Weak cordiality conjecture. For any abelian group…