59 search results - page 5 / 12 » The Chromatic Number of Random Regular Graphs |
ARSCOM
2004
14 years 11 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
RSA
2002
14 years 11 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
CPC
2006
14 years 11 months ago
2006
82
Voted
IPL
1998
14 years 11 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
122
Voted
KDD
2012
ACM
13 years 2 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...