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粘貼模型的巨大并行性,從圖頂點(diǎn)著色問題的本質(zhì)出發(fā),先把著色問題分解成頂點(diǎn)獨(dú)立集問題和頂點(diǎn)劃分問題并給出這兩個(gè)問題的DNA粘貼算法,然后調(diào)用這兩個(gè)算法解決了圖頂點(diǎn)著色問題。
Some relations between the independence number and other parameters in K_(1,r) -free graphs;
K_(1 ,r)- free圖中點(diǎn)獨(dú)立數(shù)與其它參數(shù)之間的關(guān)系(英文)