765 search results - page 87 / 153 » Graph Coloring with Rejection |
DM
2007
13 years 8 months ago
2007
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
JACM
2002
13 years 8 months ago
2002
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planar...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
DM
1999
13 years 8 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
VIS
2004
IEEE
14 years 10 months ago
2004
IEEE
Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results fr...