In this paper, we study a method of classification by density in an unweighted graph. We search some areas with a high density of edges, that can be overlapping (we don't try to obtain a partition but some intrinsic classes). The method consists of two steps ; first we determine the cores of the...