COMBINATORICA
2011
13 years 16 days ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
ICDCN
2011
Springer
13 years 4 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
JCT
2008
14 years 21 days ago
2008
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
FSTTCS
2001
Springer
14 years 5 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...