Sciweavers

DM
2008
116views more  DM 2008»
14 years 8 hour ago
Breaking the rhythm on graphs
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
Noga Alon, Jaroslaw Grytczuk
COMBINATORICS
2007
84views more  COMBINATORICS 2007»
14 years 14 days ago
A Characterization of Balanced Episturmian Sequences
It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: the...
Geneviève Paquin, Laurent Vuillon