On Star Coloring of Splitting Graphs
classification
🧮 math.CO
keywords
stargraphscoloringcompletesplittingappropriatebipartitecase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.