We will review some known %22width%22 parameters of graphs, and relate them to matroids. In particular, we use matroids to introduce a vertex-free definition of graph tree-width, and we show how matroid branch-width is related with decidability of MSO theories of both matroids and graphs (cf. rank-width).
We will review some known %22width%22 parameters of graphs, and relate them to matroids. In particular, we use matroids to introduce a vertex-free definition of graph tree-width, and we show how matroid branch-width is related with decidability of MSO theories of both matroids and graphs (cf. rank-width). (en)
We will review some known %22width%22 parameters of graphs, and relate them to matroids. In particular, we use matroids to introduce a vertex-free definition of graph tree-width, and we show how matroid branch-width is related with decidability of MSO theories of both matroids and graphs (cf. rank-width). (cs)