762 search results - page 65 / 153 » Strategic Coloring of a Graph |
99
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
131
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
160
click to vote
ENDM
2007
15 years 4 months ago
2007
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
147
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
118
click to vote
JGAA
2006
15 years 4 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...