On Star Coloring of Splitting Graphs

From MaRDI portal




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 page was built for publication: On Star Coloring of Splitting Graphs

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