Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420908 | Discrete Applied Mathematics | 2007 | 13 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mamadou Moustapha Kanté,