A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a predicate expressing that a set has even cardinality. We obtain a slight weakening of a conjecture by Seese stating that sets of graphs having a decidable satisfiability problem for monadic second-order logic have bounded clique-width. We also obtain a polynomial-time algorithm to check that the rank-width of a graph isdoi:10.1016/j.jctb.2006.04.003 fatcat:3dfb5tqexndablnknwykkbcdlu