1302 search results - page 27 / 261 » On the Strong Chromatic Number |
134
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
138
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many high resolution images exhibit chromatic aberration (CA), where the color channels appear shifted. Unfortunately, merely compensating for these shifts is sometimes inadequate...
160
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
115
click to vote
CSJM
2007
15 years 6 months ago
2007
We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,. . . ,k} such that, for every non-pendant vertex x of G, ...
166
click to vote
FOCS
2006
IEEE
16 years 7 days ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...