The complexity of the empire colouring problem for linear forests

In a recent paper we have shown that if s≥3, s- COLr is NP-hard for linear forests if s