3471 search results - page 27 / 695 » Obstacle Numbers of Graphs |
JGT
2010
13 years 6 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
JSYML
2008
13 years 7 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
TCS
2010
13 years 6 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
DM
2000
13 years 7 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple