更改

跳到导航 跳到搜索
添加45字节 、 2020年9月6日 (日) 19:52
第208行: 第208行:     
== Coloring ==
 
== Coloring ==
着色<br>
+
'''<font color="#FF8000">着色 Coloring </font>'''<br>
    
Given a random graph ''G'' of order ''n'' with the vertex ''V''(''G'') = {1, ..., ''n''}, by the [[greedy algorithm]] on the number of colors, the vertices can be colored with colors 1, 2, ... (vertex 1 is colored 1, vertex 2 is colored 1 if it is not adjacent to vertex 1, otherwise it is colored 2, etc.).<ref name = "Random Graphs2" />
 
Given a random graph ''G'' of order ''n'' with the vertex ''V''(''G'') = {1, ..., ''n''}, by the [[greedy algorithm]] on the number of colors, the vertices can be colored with colors 1, 2, ... (vertex 1 is colored 1, vertex 2 is colored 1 if it is not adjacent to vertex 1, otherwise it is colored 2, etc.).<ref name = "Random Graphs2" />
274

个编辑

导航菜单