Classification of all associative mono--ary algebras with 2 elements.
On multiperiodic infinite recursions and their finite core.
Note On The Game Colouring Number Of Powers Of Graphs
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 game colouring number of the underlying graph. Furthermore, we improve these bounds in case the underlying graph is a forest.
Page 1