1 problem
A class of digraphs is dichromatically bounded if its dichromatic number is bounded as a function of its clique number. The substitution conjecture. If a class of digr…
A class of digraphs is dichromatically bounded if its dichromatic number is bounded as a function of its clique number. The substitution conjecture. If a class of digr…