Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

128

CORR
2011
Springer

174views Education» more CORR 2011»

Lower bounds on the obstacle number of graphs

14 years 10 months ago

Lower bounds on the obstacle number of graphs

Download www.cs.elte.hu

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 of G are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The obstacle number of G is the minimum number of obstacles in an obstacle representation of G. It is shown that there are graphs on n vertices with obstacle number at least Ω(n/logn).

Padmini Mukkamala, János Pach, Döm&oum

Real-time Traffic

CORR 2011 | Corresponding Points | Education | Obstacle Number | Obstacle Representation |

claim paper

Related Content

» Graphs with Large Obstacle Numbers

» A new lower bound on the independence number of a graph

» Lower bounds for the game colouring number of partial ktrees and planar graphs

» An Optimal Lower Bound on the Number of Variables for Graph Identification

» General Lower Bounds for the Minor Crossing Number of Graphs

» Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangula...

» Estimating the number of graphs containing very long induced paths

» Laplacian spectral bounds for clique and independence numbers of graphs

» On the packing chromatic number of Cartesian products hexagonal lattice and trees

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Padmini Mukkamala, János Pach, Dömötör Pálvölgyi

Comments (0)