1302 search results - page 23 / 261 » On the Strong Chromatic Number |
153
click to vote
JCT
2008
15 years 6 months ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
153
click to vote
JCT
2007
15 years 6 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...
183
click to vote
ICPR
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper presents an efficient Real-Time method for detecting moving objects in unconstrained environments, using a background subtraction technique. A new background model that...
169
click to vote
ICCV
2011
IEEE
14 years 6 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...
189
click to vote
ALGORITHMICA
2002
15 years 6 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...