62 search results - page 3 / 13 » On the chromatic number of random geometric graphs |
66
Voted
CPC
2010
14 years 11 months ago
2010
CPC
2008
14 years 11 months ago
2008
CPC
2002
14 years 11 months ago
2002
89
Voted
DM
2008
14 years 11 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
SIAMDM
2008
14 years 11 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...