120 search results - page 3 / 24 » Some New Ramsey Colorings |
COMBINATORICS
2004
13 years 5 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...
COCOA
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
SYNASC
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper is devoted to a new variational model for color texture modeling and color image decomposition into cartoon and texture. A given image f in the RGB space is decomposed ...
APPROX
2011
Springer
12 years 5 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
The ability of humans for color constancy, i.e. the ability to correct for color deviation caused by a different illumination, is far beyond computer vision performances: nowadays...