Coloring the power graph of a semigroup

From MaRDI portal
Publication:2014227




Abstract: Let G be a semigroup. The vertices of the power graph mathcalP(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 mathcalP(G) is at most countable, answering a recent question of Aalipour et al.









This page was built for publication: Coloring the power graph of a semigroup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014227)