1302 search results - page 33 / 261 » On the Strong Chromatic Number |
149
click to vote
ARSCOM
2008
15 years 6 months ago
2008
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least number of vertices. In this note, we show that (k; g)-cage has an r-factor of girt...
158
click to vote
JCT
2010
15 years 4 months ago
2010
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
141
click to vote
FFA
2008
15 years 6 months ago
2008
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
172
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
We say a polynomial P over ZZM strongly M -represents a Boolean function F if F(x) ≡ P(x) (mod M) for all x ∈ {0, 1}n . Similarly, P one-sidedly M -represents F if F(x) = 0 ⇐...
174
click to vote
MASCOTS
2008
15 years 7 months ago
2008
Anonymity protocols are a privacy-enhancing technology for Internet-based communication. Two important characteristics of anonymity protocols are the strength of anonymity provide...