Sciweavers

DAM
2007

Vertex-minor reductions can simulate edge contractions

13 years 10 months ago
Vertex-minor reductions can simulate edge contractions
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.
Mamadou Moustapha Kanté
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DAM
Authors Mamadou Moustapha Kanté
Comments (0)