Abstract
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognition algorithm for the diamond-free graphs which keeps the combinatorial structure of the graph by means of the decomposition, as well as an easy possibility to determine the clique number for the diamond-free graphs.