1. M. Behzad, The total chromatic number of a graph: a survey, Combinatorial Mathematics and its Applications, Proceedings of the Conference, Oxford, 1969, Academic Press, N.Y., 1971, pp. 1–9.
2. On the Δ-subgraph of graphs which are critical with respect to the chromatic index;Chetwynd;J. Combin. Theory Ser. B,1989
3. Edge-colourings of graphs;Fiorini,1977
4. The NP-completeness of some edge-partition problems;Holyer;SIAM J. Comput.,1981
5. The total coloring of a multigraph with maximal degree 4;Kostochka;Discrete Math.,1977