316 search results - page 35 / 64 » The chromatic covering number of a graph |
CORR
2010
Springer
14 years 6 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
104
click to vote
COMBINATORICA
2008
14 years 12 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
JGAA
2007
14 years 11 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
SIROCCO
2007
15 years 1 months ago
2007
We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorit...
IPL
2000
14 years 11 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...