3211 search results - page 194 / 643 » On the Grundy Number of a Graph |
146
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
171
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
162
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
156
click to vote
JCT
2006
15 years 6 months ago
2006
One of Erdos' favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n/2 vertices that spans at most n2/50 edges. We prove this when t...
188
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...