Search

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 Xs (G) of G is the least number of colors needed to star color G. In this paper, we determine the star chromatic number of lexicographic product of complete graph with complete graph Km[Kn], complete graph with wheel graph Km[Wn], complete graph with path Km[Pn] and path with path Pm[Pn]. [ABSTRACT FROM AUTHOR]

The article offers insights on the title page of the first English edition of the book "The Elements of Euclid," by Sir Henry Billingsley. It notes that the title page of this book has been admired for more than 400 years. It adds that this edition was enhanced using several engravings and volvelles. It points out that the title contains a central cartouche, which has mistakenly feature the Euclid of Megara instead of Alexandria.