1. The complexity of G-free colourability;Achlioptas;Discrete Math.,1997
2. The subchromatic number of a graph;Albertson;Discrete Math.,1989
3. L.W. Beineke, R.J. Wilson (Eds.), Selected Topics in Graph Theory, Vol. 3, Academic Press, San Diego, CA, 1988.
4. I. Broere, C.M. Mynhardt, Generalized colorings of outerplanar and planar graphs, in: Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, MI, 1984), Wiley, New York, 1985, pp. 151–161.
5. Graphs with forbidden subgraphs;Chartrand;J. Combin. Theory Ser. B,1971