266 search results - page 29 / 54 » Chromatic Ramsey numbers |
JCT
2007
14 years 11 months ago
2007
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic in...
102
click to vote
DM
2010
14 years 12 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
118
click to vote
GC
2002
Springer
14 years 11 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
105
click to vote
ICCV
2011
IEEE
13 years 12 months ago
2011
IEEE
We present a multispectral photometric stereo method for capturing geometry of deforming surfaces. A novel photometric calibration technique allows calibration of scenes containin...
127
click to vote
ALGORITHMICA
2002
14 years 11 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...