3211 search results - page 41 / 643 » On the Grundy Number of a Graph |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
CPC
2010
13 years 5 months ago
2010
APPML
2011
13 years 2 months ago
2011
DM
1998
13 years 7 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...
COMBINATORICA
2006
13 years 7 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...