36781 search results - page 66 / 7357 » Parameterizing by the Number of Numbers |
RSA
2008
13 years 9 months ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
FFA
2010
13 years 8 months ago
2010
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
GC
2010
Springer
13 years 8 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
IJFCS
2010
13 years 8 months ago
2010
Abstract. We show a Θ(n log n) bound on the maximal number of occurrences of primitively-rooted k-th powers occurring in a string of length n for any integer k, k ≥ 2. We also s...
EJC
2011
13 years 5 months ago
2011
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N-tuple is defined to be the largest positive integer that has no re...