1749 search results - page 124 / 350 » Conditional colorings of graphs |
197
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
121
click to vote
JGT
2006
15 years 6 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
157
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
185
click to vote
DM
1999
15 years 6 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
195
click to vote
AISS
2010
15 years 4 months ago
2010
This paper proposes an effective lane detection and tracking method using statistical modeling of lane color and edge-orientation in the image sequence. At first, we will address ...