On the existence of graphs with prescribed coloring parameters (Q1567294)

Let \(\chi(G)\), \(\alpha(G)\), \(\psi(G)\) be the chromatic number, the achromatic number, the pseudoachromatic number of a finite, undirected, loopless graph \(G\). The authors show: (i) For any three integers \(a\), \(b\), \(c\) with \(2\leq a\leq b\leq c\), there exists a graph \(G\) with \(\chi(G)= a\), \(\alpha(G)= b\) and \(\psi(G)= c\). (ii) For any graph \(H\) with \(\chi(H)= a\geq 2\) and a positive integer \(b\) with \(b\geq a\), there exists a supergraph \(G\) of \(H\) with \(\chi(G)= a\) and \(\alpha(G)= b\). Two problems concerning supergraphs with prescribed chromatic parameters are posed, too.