1395 search results - page 34 / 279 » (k, )-Distance-Hereditary Graphs |
RSA
2006
13 years 8 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
CPC
2007
13 years 8 months ago
2007
The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isomet...
JGT
2006
13 years 8 months ago
2006
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
COMBINATORICS
2004
13 years 8 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
EDBT
2010
ACM
13 years 10 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...