Star coloring splitting graphs of cycles

From MaRDI portal




Abstract: A star coloring of a graph G is a proper vertex coloring such that the subgraph induced by any pair of color classes is a star forest. The star chromatic number of G is the minimum number of colors needed to star color G. In this paper we determine the star-chromatic number of the splitting graphs of cycles of length n with nequiv1pmod3 and n=5, resolving an open question of Furnma'nczyk, Kowsalya, and Vernold Vivin.














This page was built for publication: Star coloring splitting graphs of cycles

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