Biclustering, which can be defined as the simultaneous clustering of rows and columns in a data matrix, has received increasing attention in recent years, being applied in many scientific scenarios (e.g. bioinformatics, text analysis, computer vision). This paper proposes a novel biclustering approach, which extends the dominant-set clustering algorithm to the biclustering case. In particular, we propose a new way of representing the problem, encoded as a graph, which allows to exploit dominant set to analyse both rows and columns simultaneously. The proposed approach has been tested by using a well known synthetic microarray benchmark, with encouraging results.