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:
“There is a potential 4-6 percentage point net gain for the President [George Bush] by replacing Dan Quayle on the ticket with someone of neutral stature.”
—Mary Matalin, U.S. Republican political advisor, author, and James Carville b. 1946, U.S. Democratic political advisor, author. All’s Fair: Love, War, and Running for President, p. 205, Random House (1994)