3211 search results - page 25 / 643 » On the Grundy Number of a Graph |
DM
2008
13 years 7 months ago
2008
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...
ENDM
2008
13 years 7 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
DAM
2007
13 years 7 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...