139 search results - page 3 / 28 » The Domatic Number of Regular Graphs |
CPC
2006
14 years 11 months ago
2006
CPC
2002
14 years 11 months ago
2002
100
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
COMBINATORICA
2006
14 years 11 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...