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:
“poor Felix Randal;
How far from then forethought of, all thy more boisterous years,
When thou at the random grim forge, powerful amidst peers,
Didst fettle for the great gray drayhorse his bright and battering
sandal!”
—Gerard Manley Hopkins (1844–1889)