: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
We find exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...