Equitable coloring and the maximum degree (Q1337614): Difference between revisions

The equitable \(h\)-coloring conjecture says that a connected graph \(G\) is equitable \(h(G)\)-colorable if it is different from \(K_ n\), \(C_{2n+1}\) and \(K_{2n+1,2n+1}\) for all \(n\geq 1\). This conjecture is proved for graphs \(G\) with \(h(G)\geq | G|/2\) or \(h(G)\leq 3\), where \(h(G)\) is the maximum vertex degree of \(G\).