3471 search results - page 13 / 695 » Obstacle Numbers of Graphs |
DM
2010
13 years 8 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
GC
2010
Springer
13 years 6 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
DM
2008
13 years 8 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
IJRR
2008
13 years 7 months ago
2008
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
IJRR
2007
13 years 7 months ago
2007
This paper proposes an algorithm that drives a unicycle type robot to a desired path, including obstacle avoidance capabilities. The path-following control design relies on Lyapun...