1. Determining the total coloring number is NP-hard;Sánchez-Arroyo;Discrete Math.,1989
2. M. Behzad, Graphs and their chromatic number, Ph.D. Thesis, Michigan State University, 1965
3. [M] Graph Theory with Application;Bondy,1976
4. On the properties and chromatic of Pseudo-Halin graph;Liu;J. Lanzhou Railway Institute (Natural Science),2001
5. On an estimate of the chromatic class of a p-graph;Vizing;Metody Diskret. Analiz.,1964