444 search results - page 1 / 89 » More Colourful Simplices |
103
Voted
DCG
2011
14 years 5 months ago
2011
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
62
Voted
VRML
1999
ACM
15 years 2 months ago
1999
ACM
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
COLOGNETWENTE
2009
14 years 11 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
83
Voted
JCO
2008
14 years 10 months ago
2008
We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.