Share  Bookmark

 Download from



[1] H.L. Bodlaender. Achromatic number is NPcomplete for cographs and interval graphs. Information Processing Letters, 31:135{138, 1989.
[2] N. Cairnie and K. Edwards. Some results on the achromatic number. Journal of Graph Theory, 26:129{136, 1997.
[3] A. Chaudhary and S. Vishwanathan. Approximation algorithms for the achromatic number. In Proceedings of the 8th ACMSIAM Symposium on Discrete Algorithms, pages 557{562. ACMSIAM, 1997.
[4] G.A. Cheston, G. Fricke, S.T. Hedetniemi, and D.P. Jacobs. On the computational complexity of upper fractional domination. Discrete Applied Mathematics, 27:195{ 207, 1990.
[5] C.A. Christen and S.M. Selkow. Some perfect coloring properties of graphs. Journal of Combinatorial Theory, Series B, 27:49{59, 1979.
[6] M. Farber, G. Hahn, P. Hell, and D. Miller. Concerning the achromatic number of a graph. Journal of Combinatorial Theory, Series B, 40:21{39, 1986.
[7] M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, San Francisco, CA., 1979.
[8] M.M. Halldo¶rsson. Approximating the minimum maximal independence number. Information Processing Letters, 46:169{172, 1993.
[9] F. Harary. Maximum versus minimum invariants for graphs. Journal of Graph Theory, 7:275{284, 1983.
[10] F. Harary and S. Hedetniemi. The achromatic number of a graph. Journal of Combinatorial Theory, 8:154{161, 1970.