On the total coloring of generalized Petersen graphs

We show that “almost all” generalized Petersen graphs have total chromatic number 4. More precisely: for each integer k≥2k≥2, there exists an integer N(k)N(k) such that, for any n≥N(k)n≥N(k), the generalized Petersen graph G(n,k)G(n,k) has total chromatic number 4.