2019/06/15 by Saieed Akbari, M. Chavooshi, Akbari, S +5
Computer Science · #Advanced Graph Theory Research
paper · pdf · doi:10.48550/arxiv.1906.06561
A proper vertex coloring of a graph G is called a star coloring if every two color classes induce a forest whose each component is a star, which means there is no bicolored P4 in G. In this paper, we show that the Cartesian product of any two cycles, except C3 \square C3 and C3 \square C5, has a 5-star coloring.