**4. Theoretical background**

Optimal channel assignment in WMNs is an NP-hard problem (similar to the graph coloring problem). For this reason, before we present the channel assignment problem in WMNs, let us first provide some mathematical background about graph coloring problem.
