Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
graph_theory [2019/01/01 21:59]
paul [Graph Terminology]
graph_theory [2019/03/31 14:49] (current)
Line 45: Line 45:
 Basic graph coloring algorithm for $G=(V,E)$ Basic graph coloring algorithm for $G=(V,E)$
  
-    ​- Order the nodes $V_1, V_2 .. V_n$ +    - Order the nodes $V_1, V_2 .. V_n$ 
-    ​- Order the colors $C_1, C_2 .. C_k$ +    - Order the colors $C_1, C_2 .. C_k$ 
-    ​- For $i = 1,2 ... n$ assign lowest legal color for $V1$+    - For $i = 1,2 ... n$ assign lowest legal color for $V1$ 
 + 
 + 
  • graph_theory.txt
  • Last modified: 2019/03/31 14:49
  • (external edit)