Total chromatic number of graphs of odd order and high degree (Q1301827): Difference between revisions

It is proved that if a simple graph \(G\) has odd order \(|V(G)|\), minimum degree \(\delta(G)\) and \(r(G)\) vertices of maximum degree \(\Delta(G)\) such that \(\Delta(G)+ \delta(G)\geq 3/2 |V(G)|+ r(G)+ 5/2\), then \(\chi_T(G)= \Delta(G)+ 1\), where \(\chi_T(G)\) is the total chromatic number of \(G\).