Local Search Improvements for Soft Happy Colouring

Mohammad Hadi Shekarriz, Dhananjay Thiruvady, Asef Nazari +1

For $0\le \ddot{I}\le 1$ and a coloured graph $G$, a vertex $v$ is $\ddot{I}$-happy if at least $\ddot{I}\mathrm{deg}(v)$ of its neighbours have the same colour as $v$. Soft happy colouring of a p…