Harmonious Colorings: bounds, heuristics and integer-linear formulations

Júlio Araújo, Manoel Campêlo, Beatriz Martins +1

A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\in E(G)$, we have that $\{c(u),c(v)\}\ne \{c(x),c(y)\}$. The harmonious chrom…