3471 search results - page 61 / 695 » Obstacle Numbers of Graphs |
161
click to vote
ENDM
2007
15 years 6 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
131
click to vote
AAAI
1990
15 years 7 months ago
1990
In this article we present a novel, hybrid graph spatial representation for robot navigation. This representation enables our mobile robot to build a model of its surroundings whi...
162
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
155
click to vote
JCT
2010
15 years 4 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
156
click to vote
ARSCOM
2007
15 years 6 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...