Star Coloring of the Cartesian Product of Cycles

arXiv1906.06561MaRDI QIDQ6320550FDOQ6320550

Authors: S. Akbari, M. Chavooshi, M. Ghanbari, S. Taghian 

Publication date: 15 June 2019

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}square{C}_3$ and $C_{3}square{C}_5$, has a $5$-star coloring.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320550)