226 search results - page 1 / 46 » Lower bounds on the obstacle number of graphs |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
WG
2010
Springer
13 years 3 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
DM
2008
13 years 4 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
FOCS
1989
IEEE
13 years 8 months ago
1989
IEEE