文摘
The graph-theoretic parameter that has probably received the most attention over the years is the chromaticnumber. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has beensolved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactoryfidelity. This work shows further evidence for the ability of DNA computing to solve NP-Complete problems.