Vertex-minor reductions can simulate edge contractions

Authors:
Mamadou Moustapha Kanté
Affiliations:
LaBRI, Université Bordeaux 1, CNRS, 351 Cours de la libération, 33405 Talence Cedex, France
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 15
Cited 3

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Tree-partite graphs and the complexity of algorithms

FCT '85 Fundamentals of Computation Theory
On the Relationship Between Clique-Width and Treewidth

SIAM Journal on Computing
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Rank-width and vertex-minors

Journal of Combinatorial Theory Series B
Clique-width minimization is NP-hard

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
Vertex-minors, monadic second-order logic, and a conjecture by Seese

Journal of Combinatorial Theory Series B
Approximating rank-width and clique-width quickly

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Graph operations characterizing rank-width

Discrete Applied Mathematics
Graph operations characterizing rank-width and balanced graph expressions

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On the Boolean-width of a graph: structure and applications

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science

Quantified Score

Hi-index	0.04

Visualization

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.