3204 search results - page 72 / 641 » The b-chromatic Number of a Graph |
AMCS
2010
13 years 8 months ago
2010
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
EJC
2008
13 years 10 months ago
2008
Let denote a distance-regular graph with classical parameters (D, b, , ) and D 3. Assume the intersection numbers a1 = 0 and a2 = 0. We show is 3-bounded in the sense of the ar...
TCS
2008
13 years 10 months ago
2008
Graph searching encompasses a wide variety of combinatorial problems related to the problem of capturing a fugitive residing in a graph using the minimum number of searchers. In t...
DM
1998
13 years 9 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...