Special Classes of Graphs
The NP-completeness of the achromatic number problem holds also for some special classes of graphs: bipartite graphs, complements of bipartite graphs (that is, graphs having no independent set of more than two vertices), cographs and interval graphs, and even for trees.
For complements of trees, the achromatic number can be computed in polynomial time. For trees, it can be approximated to within a constant factor.
The achromatic number of an n-dimensional hypercube graph is known to be proportional to, but the constant of proportionality is not known precisely.
Read more about this topic: Complete Coloring
Famous quotes containing the words special and/or classes:
“People generally will soon understand that writers should be judged, not according to rules and species, which are contrary to nature and art, but according to the immutable principles of the art of composition, and the special laws of their individual temperaments.”
—Victor Hugo (1802–1885)
“I have no doubt but that the misery of the lower classes will be found to abate whenever the Government assumes a freer aspect and the laws favor a subdivision of Property.”
—James Madison (1751–1836)