Abstract For 0< ρ≤ 1, a ρ-happy vertex v in a coloured graph G has at least ρ⋅ deg (v) same-
colour neighbours, and a ρ-happy colouring (aka soft happy colouring) of G is a vertex …