Sciweavers

751 search results - page 21 / 151
» The Distinguishing Chromatic Number
Sort
View
COMBINATORICS
2006
97views more  COMBINATORICS 2006»
13 years 11 months ago
H-Free Graphs of Large Minimum Degree
We prove the following extension of an old result of Andr
Noga Alon, Benny Sudakov
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 11 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 10 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 11 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
14 years 3 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