Total chromatic number of graphs of high degree, II
Total chromatic number of graphs of high degree, II
Abstract We prove Theorem 1: suppose G is a simple graph of order n having Δ( G ) = n − k where k ≥ 5 and n ≥ max (13, 3 k −3). If G contains an independent set of k − 3 vertices, then the TCC (Total Colouring …