Vertex-minor reductions can simulate edge contractions ?
We prove that local complementation and vertex deletion, operations from which vertex-minors 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.
vertex-minor edge contraction local complementation rank-width clique-width tree-width tree-decomposition