1. J. Bensmail, R. Duvignau, S. Kirgizov, The complexity of deciding whether a graph admits an orientation with fixed weak diameter, 2013 Preprint, available at http://hal.archives-ouvertes.fr/hal-00824250.
2. On the pseudoachromatic number of a graph;Bhave;Fund. Math.,1979
3. On deeply critical oriented graphs;Borodin;J. Combin. Theory Ser. B,2001
4. Some results on the achromatic number;Cairnie;J. Graph Theory,1997
5. The achromatic number of bounded degree trees;Cairnie;Discrete Math.,1998