Star Coloring of the Cartesian Product of Cycles

Abstract: 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

P_{4}

in

G

. In this paper, we show that the Cartesian product of any two cycles, except

C_{3} s q u a r e C_{3}

and

C_{3} s q u a r e C_{5}

, has a

5

-star coloring.

This page was built for publication: Star Coloring of the Cartesian Product of Cycles