Coloring the power graph of a semigroup

From MaRDI portal
Publication:2014227

DOI10.1007/S00373-017-1773-8zbMATH Open1368.05056arXiv1607.00420OpenAlexW2963791943MaRDI QIDQ2014227FDOQ2014227


Authors: Ya. N. Shitov Edit this on Wikidata


Publication date: 10 August 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1607.00420




Recommendations




Cites Work


Cited In (20)





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)