Loading...

Star chromatic number of some graphs

Akbari, S ; Sharif University of Technology | 2022

9 Viewed
  1. Type of Document: Article
  2. DOI: 10.1142/S1793830921500890
  3. Publisher: World Scientific , 2022
  4. Abstract:
  5. A proper vertex coloring of a graph G is called a star coloring if every two color classes induce a forest whose each component is a star, which means there is no bicolored P4 in G. In this paper, we show that the Cartesian product of any two cycles, except C3C3 and C3C5, has a 5-star coloring. © 2022 World Scientific Publishing Company
  6. Keywords:
  7. Cartesian products ; Star coloring ; Vertex coloring
  8. Source: Discrete Mathematics, Algorithms and Applications ; Volume 14, Issue 1 , 2022 ; 17938309 (ISSN)
  9. URL: https://people.clas.ufl.edu/avince/files/CircularChromatic.pdf