Results 1 to 10 of about 9,431,687 (143)
Game Chromatic Number of Shackle Graphs [PDF]
JTAM (Jurnal Teori dan Aplikasi Matematika), 2021 Coloring vertices on graph is one of the topics of discrete mathematics that are still developing until now. Exploration Coloring vertices develops in the form of a game known as a coloring game. Let G graph.
Firmansyah Firmansyah, Abdul Mujib
doaj +2 more sources
The game chromatic number of trees and forests [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and then
Charles Dunn +4 more
doaj +4 more sources
Game chromatic number of lexicographic product graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2015 In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple ...
R. Alagammai, V. Vijayalakshmi
doaj +2 more sources
The game chromatic number of corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper, we compute an upper bound for the game chromatic number of corona of any two simple graphs G and H, denoted by Also, we determine the game chromatic number of ...
R. Alagammai, V. Vijayalakshmi
doaj +2 more sources
Game Chromatic Number of Generalized Petersen Graphs and Jahangir Graphs
Journal of Applied Mathematics, 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.
Ramy Shaheen +2 more
doaj +2 more sources
Bears with Hats and Independence Polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Consider the following hat guessing game. A bear sits on each vertex of a graph $G$, and a demon puts on each bear a hat colored by one of $h$ colors. Each bear sees only the hat colors of his neighbors.
Václav Blažej +2 more
doaj +1 more source
Game-Perfect Semiorientations of Forests
Discussiones Mathematicae Graph Theory, 2022 We consider digraph colouring games where two players, Alice and Bob, alternately colour vertices of a given digraph D with a colour from a given colour set in a feasible way. The game ends when such move is not possible any more.
Andres Stephan Dominique +2 more
doaj +1 more source
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
AKCE International Journal of Graphs and Combinatorics, 2020 We prove that the game-perfect digraphs defined by Andres (2012) with regard to a digraph version of the maker-breaker graph colouring game introduced by Bodlaender (1991) always have a kernel.
Stephan Dominique Andres
doaj +1 more source
Line game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj +1 more source
Note On The Game Colouring Number Of Powers Of Graphs
Discussiones Mathematicae Graph Theory, 2016 We generalize the methods of Esperet and Zhu [6] providing an upper bound for the game colouring number of squares of graphs to obtain upper bounds for the game colouring number of m-th powers of graphs, m ≥ 3, which rely on the maximum degree and the ...
Andres Stephan Dominique, Theuser Andrea
doaj +1 more source