1 problem
Let be an Abelian group. A family of graphs is weakly -cordial if all but finitely many graphs in the family are -cordial. Erickson–Klein conjecture. For every Abelian gr…
Let be an Abelian group. A family of graphs is weakly -cordial if all but finitely many graphs in the family are -cordial. Erickson–Klein conjecture. For every Abelian gr…