Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ulagammal Subramanian"'
Publikováno v:
Facta Universitatis, Series: Mathematics and Informatics. :507
A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number χs (G) of G is the least number of colors needed to star color G. Let G = (V,E) be a graph with V = S1 [ S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::090186195210f8b9733792c389967a12
https://doi.org/10.22190/fumi2002507s
https://doi.org/10.22190/fumi2002507s
