Answer: $\mathbf A$
Let's represent this situation in the form of a graph. Consider matches as the nodes in which the same edge represents that the different matches are overlapping. So, for this situation, we need different referees and linesmen.
So, how would you solve this?
Definitely by taking care that the nodes which have the same edge do not have the same referee or linesman(think of referee and linesman as the color of the nodes now)
So, basically we just have to solve the minimal coloring problem now, which will be the required answer to the above problem.