We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank-width of a graph is linearly bounded in term of its tree-width. Key words: Clique-width, rank-width, tree-width, tree-decomposition, local complementation, edge contraction, vertex-minor.