720 search results - page 44 / 144 » Nonrepetitive colorings of graphs |
PERCOM
2008
ACM
14 years 2 months ago
2008
ACM
In this paper we present a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the probl...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
DAM
2006
13 years 7 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
ANOR
2002
13 years 7 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
JUCS
2006
13 years 7 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...