We show that "almost all" generalized Petersen graphs have total chromatic number 4. More precisely: for each integer k ? 2 , there exists an integer N ( k ) such that, for any n ? N ( k ) , the generalized Petersen graph G ( n , k ) has total chromatic number?4.
['Simone Dantas', 'C. M. H. de Figueiredo', 'Giuseppe Mazzuoccolo', 'Myriam Preissmann', 'V.F. dos Santos', 'Daisuke Sasaki']
On the total coloring of generalized Petersen graphs