Some results on the achromatic number

On approximating the achromatic number

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Efficient Approximation Algorithms for the Achromatic Number

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms

Complete partitions of graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Efficient approximation algorithms for the achromatic number

Theoretical Computer Science - Approximation and online algorithms

NP-completeness results for some problems on subclasses of bipartite and chordal graphs

Theoretical Computer Science

Note: The harmonious coloring problem is NP-complete for interval and permutation graphs

Discrete Applied Mathematics

Harmonious coloring on subclasses of colinear graphs

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation

Full friendly index set - I

Discrete Applied Mathematics