3211 search results - page 15 / 643 » On the Grundy Number of a Graph |
ENDM
2008
13 years 7 months ago
2008
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
JCT
2007
13 years 7 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
DM
2007
13 years 7 months ago
2007
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
JGT
2010
13 years 6 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
GFKL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...