On matroid properties definable in the MSO logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 470-479

  Hliněný, Petr ^a  

^a MATEJ BEL UNIVERSITY   (Slovakia)

Author keywords

Branch width; Matroid; MSO logic; Parametrized complexity

Indexed keywords

GRAPH THEORY; POLYNOMIAL APPROXIMATION;

BRANCH-WIDTH; FINITE FIELDS; MATROID; MONADIC SECOND-ORDER LOGIC; MSO LOGIC; PARAMETRIZED COMPLEXITY; POLYNOMIAL-TIME;

COMBINATORIAL MATHEMATICS;

EID: 32144457687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_41     Document Type: Article

References (13)

1. H.L. Bodlaender, A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM J. Computing 25 (1996), 1305-1317.
2. B. Courcelle, The Monadic Second-Order Logic of Graphs I. Recognizable sets of Finite Graphs, Information and Computation 85 (1990), 12-75.
3. J. de Sousa, D.J.A. Welsh, A Characterisation of Binary Transversal Matroids, J. Math. Anal. Appl. 40 (1972), 55-59.
4. R.G. Downey, M.R. Fellows, Parametrized Complexity, Springer-Verlag, 1999.
5. J.F. Geelen, A.H.M. Gerards, N. Robertson, G.P. Whittle, On the Excluded Minors for the Matroids of Branch-Width k, J. Combin. Theory Ser. B, to appear (2003).
6. J.F. Geelen, A.H.M. Gerards, G.P. Whittle, Branch-Width and Well-Quasi-Ordering in Matroids and Graphs, J. Combin. Theory Ser. B 84 (2002), 270-290.
7. P. Hliněný, Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids (Extended Abstract), In: STACS 2003, Lecture Notes in Computer Science 2607, Springer Verlag (2003), 319-330.
8. P. Hliněný, Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids, submitted, 2002.
9. P. Hliněný, A Parametrized Algorithm for Matroid Branch-Width, submitted, 2002.
10. P. Hliněný, The Tutte Polynomial for Matroids of Bounded Branch-Width, submitted, 2002.
11. P. Hliněný, It is Hard to Recognize Free Spikes, submitted, 2002.
12. J.G. Oxley, Matroid Theory, Oxford University Press, 1992,1997.
13. N. Robertson, P.D. Seymour, Graph Minors X. Obstructions to Tree-Decomposition, J. Combin. Theory Ser. B 52 (1991), 153-190.