Sciweavers

720 search results - page 41 / 144
» Nonrepetitive colorings of graphs
Sort
View
COMBINATORICS
2006
128views more  COMBINATORICS 2006»
13 years 7 months ago
On Lengths of Rainbow Cycles
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
Boris Alexeev
GC
2007
Springer
13 years 7 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
CVIU
2008
141views more  CVIU 2008»
13 years 7 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 5 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
ICC
2007
IEEE
101views Communications» more  ICC 2007»
14 years 1 months ago
Transmission Scheduling in Sensor Networks via Directed Edge Coloring
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
Maggie X. Cheng, Li Yin