3211 search results - page 150 / 643 » On the Grundy Number of a Graph |
110
click to vote
ESA
2007
Springer
16 years 17 days ago
2007
Springer
In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
177
click to vote
GBRPR
2007
Springer
16 years 17 days ago
2007
Springer
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...
183
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
134
click to vote
JGT
2010
15 years 4 months ago
2010
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
154
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...