On Star Coloring of Splitting Graphs
Hanna Furma\'nczyk, Kowsalya V, Vernold Vivin J
TL;DR
This paper investigates the star coloring problem in splitting graphs, providing exact star chromatic numbers for specific graph classes and offering constructive proofs for these colorings.
Contribution
It establishes the star chromatic number for splitting graphs of complete, bipartite, path, and cycle graphs with constructive methods.
Findings
Star chromatic number for splitting complete graphs determined.
Star chromatic number for splitting bipartite graphs determined.
Constructive proofs lead to explicit star colorings.
Abstract
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our proofs are constructive, so they lead to appropriate star colorings of graphs under consideration.
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
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · graph theory and CDMA systems