Sciweavers

4298 search results - page 20 / 860
» Measurable chromatic numbers
Sort
View
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
Coloring translates and homothets of a convex body
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
Adrian Dumitrescu, Minghui Jiang
ENDM
2007
149views more  ENDM 2007»
13 years 7 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
Pascal Ochem, Alexandre Pinlou
DM
2008
103views more  DM 2008»
13 years 7 months ago
Improper colouring of (random) unit disk graphs
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
Ross J. Kang, Tobias Müller, Jean-Séba...
ICIP
2000
IEEE
13 years 11 months ago
Chromaticity Diffusion
—A novel approach for color image denoising is proposed in this paper. The algorithm is based on separating the color data into chromaticity and brightness, and then processing e...
Bei Tang, Guillermo Sapiro, Vicent Caselles
EJC
2006
13 years 7 months ago
Symplectic graphs and their automorphisms
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
Zhongming Tang, Zhe-xian Wan