145 search results - page 11 / 29 » Strong Colorings of Hypergraphs |
JUCS
2002
14 years 9 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
129
Voted
STRINGOLOGY
2008
14 years 11 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
Inter-color correlation between the luminance component and chrominance components has been utilized for color image coding for years. However, the correlation has not been clearl...