Clique-width and edge contraction
Edge contractions can increase clique-width and rank-width. Using monadic second-order graph transductions to prove that certain graphs have unbounded clique-width. An alternative proof is given using vertex-minors. Taking induced topological minors preserves bounded clique-width.
clique-width edge contraction graph algorithms rank-width monadic second-order transduction vertex-minor