3204 search results - page 317 / 641 » The Alcuin Number of a Graph |
178
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...
169
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...
160
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...
179
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
214
Voted
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...