1 problem

Let $\mathcal{C}$ be a class of graphs with bounded treewidth. Bounded-treewidth rainbow separability conjecture. The class $\mathcal{C}$ is rainbow separable. This conjecture asks…