617 search results - page 10 / 124 » On the Chromatic Number of Random Graphs |
DM
2006
15 years 3 months ago
2006
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
144
click to vote
COMBINATORICA
2008
15 years 3 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
142
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
133
click to vote
GC
2010
Springer
15 years 2 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
109
Voted
JGT
2011
14 years 10 months ago
2011