3471 search results - page 64 / 695 » Obstacle Numbers of Graphs |
DAM
2007
13 years 9 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
LICS
1991
IEEE
14 years 21 days ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
EWCG
2000
13 years 10 months ago
2000
We investigate the exploration problem of a short-sighted mobile robot moving about in an unknown cellular room. In order to explore a cell, the robot must enter it. Once inside, ...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
JGT
2010
13 years 7 months ago
2010
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...