720 search results - page 13 / 144 » Nonrepetitive colorings of graphs |
STRINGOLOGY
2008
13 years 9 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
13 years 7 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...
RSA
2006
13 years 7 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
ASP
2003
Springer
14 years 22 days ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
SIAMDM
2008
13 years 7 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...