Abstract:
The graphical theory of direct decompositions of torsion-free abelian groups of a certain type is considered as the basis for the algorithmic construction of the set of their direct decompositions satisfying some specified conditions.
Keywords:torsion-free abelian group of finite rank, direct decomposition, almost isomorphism, $r$-colorable graph, algorithm.