102 search results - page 2 / 21 » Colored graphs without colorful cycles |
COLOGNETWENTE
2009
13 years 6 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
GC
2008
Springer
13 years 5 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if nec...
COMBINATORICS
2006
13 years 5 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...