Regular ArticleApproximation Algorithms for the Achromatic Number
References (12)
Achromatic number is NP-complete for co-graphs and interval graphs
Inform. Proces. Lett.
(1989)- et al.
Concerning the achromatic number of graphs
J. Combin. Theory Ser. B
(1986) - et al.
The achromatic number of a graph
J. Combin. Theory
(1970) Approximating the minimum maximal independence number
Inform. Process. Lett.
(1993)Extremal Graph Theory
(1978)
There are more references available in the full text version of this article.
Cited by (9)
Approximation algorithms for the achromatic number of butterfly and Beneš networks
2020, Procedia Computer ScienceMinimum order of graphs with given coloring parameters
2015, Discrete MathematicsAn Approximation Algorithm for the Achromatic Number of Web Graph
2022, Lecture Notes in Networks and SystemsOn the achromatic number of mesh like trees
2020, Advances in Mathematics: Scientific JournalOn the achromatic number of silicate networks
2013, International Journal of Pure and Applied MathematicsAn approximation algorithm for the achromatic number of circulant graphs G(n;±{1,2}), G(n;±{1,2,3})
2011, Journal of Combinatorial Mathematics and Combinatorial Computing
Copyright © 2001 Elsevier Science (USA). All rights reserved.