720 search results - page 108 / 144 » Nonrepetitive colorings of graphs |
GMP
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
SIAMDM
2008
13 years 7 months ago
2008
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
ADHOCNOW
2004
Springer
14 years 1 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
SOCIALCOM
2010
13 years 5 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...