Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Khaled Alshehada"'
Publikováno v:
Journal of Applied Mathematics, Vol 2020 (2020)
Let G=V,E be a graph, and two players Alice and Bob alternate turns coloring the vertices of the graph G a proper coloring where no two adjacent vertices are signed with the same color. Alice's goal is to color the set of vertices using the minimum n
Externí odkaz:
https://doaj.org/article/636ad762faec4e9d98a34d56134ba734
Publikováno v:
Open Journal of Discrete Mathematics. :159-164
Let G be a graph and k be a positive integer. We consider a game with two players Alice and Bob who alternate in coloring the vertices of G with a set of k colors. In every turn, one vertex will be chosen by one player. Alice’s goal is to color all