Coloring of Random Graphs
Given a random graph G of order n with the vertex V(G)={1,2,...,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).
Read more about this topic: Random Graphs
Famous quotes containing the word random:
“We should stop looking to law to provide the final answer.... Law cannot save us from ourselves.... We have to go out and try to accomplish our goals and resolve disagreements by doing what we think is right. That energy and resourcefulness, not millions of legal cubicles, is what was great about America. Let judgment and personal conviction be important again.”
—Philip K. Howard, U.S. lawyer. The Death of Common Sense: How Law Is Suffocating America, pp. 186-87, Random House (1994)