Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509)

The authors establish some new polynomial-time computable upper bounds on \(\mu+\chi\) and \(\mu\chi\), where \(\chi\) is the chromatic number and \(\mu\) is one of the following domination parameters: \(\gamma\), \(i\), \(ir\). The bounds are sharp and the corresponding extremal graphs are characterized.