• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Coloring the power graph of a semigroup

Graphs and Combinatorics. 2017. Vol.  33. P. 485-487.

Let G be a semigroup. The vertices of the power graph P(G) are the elements of G, and two elements are adjacent if and only if one of them is a power of the other. We show that the chromatic number of P(G) is at most countable, answering a recent question of Aalipour et al.