Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …

The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph $ G $
in a given order and assigns the first available color to each vertex $ v $ in $ G $. In the {\sc …

A b-coloring of a graph G is a proper coloring such that each color class has at least one
vertex which is adjacent to each other color class. The b-spectrum of G is the set S b (G) of …

A proper k-coloring with colors 1, 2,…, k of a graph G=(V, E) is an ordered partition (V 1, V
2,…, V k) of V such that V i is an independent set or color class in which each vertex v∈ V i …

A proper k-coloring of G=(V, E) G=(V, E) is an assignment of k colors to vertices of G such
that no two adjacent vertices receive the same color. A proper k-coloring of a graph G=(V, E) …