Chromatic number of some families of graphs
Anam Rani, N. Parvathi · Journal of Discrete Mathematical Sciences and Cryptography · 2019
A k-coloring of a graph is a vertex coloring of G that uses k-colors. The chromatic number χ(G) of a graph G is the minimum number of independent subsets that partition the vertex set of G. Any such minimum partition is called a chromatic partition of V(G). In this paper chromatic number of Sunlet and Bistar families of graphs are found