1. Achromatic number is NP-complete for co-graphs and interval graphs;Bodlaender;Inform. Proces. Lett.,1989
2. Extremal Graph Theory;Bollobás,1978
3. Concerning the achromatic number of graphs;Farber;J. Combin. Theory Ser. B,1986
4. Computers and Intractability;Garey,1979
5. N. Goyal, and, Sundar, Vishwanathan, A simple proof of NP-completeness of undirected grundy numbering and related problems, personal communication.