36781 search results - page 42 / 7357 » Parameterizing by the Number of Numbers |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...
DAM
2007
13 years 10 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
TIT
2008
13 years 10 months ago
2008
Abstract-- We study network coding capacity under a constraint on the total number of network nodes that can perform coding. That is, only a certain number of network nodes can pro...
APPML
2011
13 years 5 months ago
2011
Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of ...
ALT
2007
Springer
14 years 7 months ago
2007
Springer
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...