We derive from Boolean methods a transformation which, when applicable, builds from a given graph a new graph with the same stability number and with the number of vertices decreased by one. We next describe classes of graphs for which such a transformation leads to a polynomial algorithm for computing the stability number.