Using the huge parallelism of DNA sticker models, we first decompose the vertex-coloring problems of graph into vertex-independent set problems and vertex-partition problems from the essence of problems and show DNA sticker algorithms of the two problems.

利用DNA粘貼模型的巨大并行性,從圖頂點著色問題的本質出發(fā),先把著色問題分解成頂點獨立集問題和頂點劃分問題并給出這兩個問題的DNA粘貼算法,然后調用這兩個算法解決了圖頂點著色問題。

Some relations between the independence number and other parameters in K_(1,r) -free graphs;

K_(1 ,r)- free圖中點獨立數與其它參數之間的關系(英文)