212 search results - page 1 / 43 » On Lengths of Rainbow Cycles |
COMBINATORICS
2006
13 years 4 months ago
2006
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...
GC
2010
Springer
13 years 2 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
DM
2010
13 years 4 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
COMGEO
2012
ACM
12 years 17 days ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
TIT
2008
13 years 4 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...