论文信息 - Matroid tree-width

Matroid tree-width

We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This extension was inspired by an original unpublished idea of Jim Geelen.) We prove that the tree-width of a graphic matroid is equal to that of its underlying graph. Furthermore, we extend the well-known relation between the branch-width and the tree-width of a graph to all matroids.

Petr Hliněný | Geoff Whittle

[1] Petr Hlinený,et al. A Parametrized Algorithm for Matroid Branch-Width , 2005, SIAM J. Comput..

[2] Detlef Seese,et al. Trees, grids, and MSO decidability: From graphs to matroids , 2006, Theor. Comput. Sci..

[3] Bert Gerards,et al. Branch-Width and Well-Quasi-Ordering in Matroids and Graphs , 2002, J. Comb. Theory, Ser. B.

[4] Bert Gerards,et al. On the excluded minors for the matroids of branch-width k , 2003, J. Comb. Theory, Ser. B.

[5] B. Bollobás. Surveys in Combinatorics , 1979 .

[6] Petr Hlinený. Branch-width, parse trees, and monadic second-order logic for matroids , 2006, J. Comb. Theory, Ser. B.

[7] Bert Gerards,et al. Excluding a planar graph from GF(q)-representable matroids , 2007, J. Comb. Theory, Ser. B.

[8] P. Seymour,et al. Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[9] Bert Gerards,et al. Obstructions to branch-decomposition of matroids , 2006, J. Comb. Theory, Ser. B.

[10] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[11] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..