Related Experiment Video
Updated: Jun 28, 2026

DNA Staining Method Based on Formazan Precipitation Induced by Blue Light Exposure
Published on: January 28, 2018
DNA solution of a graph coloring problem
Yachun Liu1, Jin Xu, Linqiang Pan
1Department of Mathematics and Physical Science, Nanhua University Hengyang, Hunan, 421001 P. R. China. liuyachun65@263.net
Abstract:
The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve NP-Complete problems.
Related Concept Videos
Karyotyping
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphs of Equations in Two Variables
Graphs of Functions
Graphical Representation of Inequalities
Graphs of Two-Variable Functions

