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
Publication date: 10 August 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: Let be a semigroup. The vertices of the power graph are the elements of , 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 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)
- Title not available (Why is that?)
- Chromatic number of the cyclic graph of infinite semigroup
- On the power graphs of certain finite groups
- The power graph of a torsion-free group determines the directed power graph
- Laplacian spectra of power graphs of certain finite groups
- Semigroups and the generalized road coloring problem
- The power graph of a torsion-free group of nilpotency class 2
- On the minimum cut-sets of the power graph of a finite cyclic group
- On the minimum degree of power graphs of finite nilpotent groups
- On characterization of a completely simple semigroup by its power graph and Green relations
- Some new results concerning power graphs and enhanced power graphs of groups
- On the clique number and independence number of the cyclic graph of a semigroup
- Recent developments on the power graph of finite groups – a survey
- A study of enhanced power graphs of finite groups
- Some properties of various graphs associated with finite groups
- On connectedness of power graphs of finite groups
- On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups
- On the structure of the power graph and the enhanced power graph of a group
- Graphs defined on groups
- Power graphs of all nilpotent groups
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)