2017/10/11 by Sumun Iyer, Iyer, Sumun
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1710.03910
openalex publication_date 2017/10/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 n ≡ 1 \pmod 3 and n=5, resolving an open question of Furnmańczyk, Kowsalya, and Vernold Vivin.