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:
“Assemble, first, all casual bits and scraps
That may shake down into a world perhaps;
People this world, by chance created so,
With random persons whom you do not know”
—Robert Graves (18951985)