Star coloring splitting graphs of cycles
Sumun Iyer

TL;DR
This paper determines the star chromatic number of splitting graphs of cycles for specific lengths, resolving an open question in graph coloring theory.
Contribution
It provides the exact star chromatic number for splitting graphs of cycles of certain lengths, advancing understanding of star colorings in graph theory.
Findings
Star chromatic number for splitting graphs of cycles with n ≡ 1 mod 3
Star chromatic number for splitting graph of cycle of length 5
Resolved an open question in the literature
Abstract
A star coloring of a graph 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 is the minimum number of colors needed to star color . In this paper we determine the star-chromatic number of the splitting graphs of cycles of length with and , resolving an open question of Furnma\'nczyk, Kowsalya, and Vernold Vivin.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Limits and Structures in Graph Theory
