MSOL partitioning problems on graphs of bounded treewidth and clique-width
Author:
- Michaël RaoMRMichaël Rao
- 1 May 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 377 (1-3) , 260-267
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Vertex-minors, monadic second-order logic, and a conjecture by SeeseJournal of Combinatorial Theory, Series B, 2007
- Approximating clique-width and branch-widthJournal of Combinatorial Theory, Series B, 2006
- The strong perfect graph theoremAnnals of Mathematics, 2006
- Algorithmic uses of the Feferman–Vaught TheoremAnnals of Pure and Applied Logic, 2004
- Algorithms for vertex-partitioning problems on graphs with fixed clique-widthTheoretical Computer Science, 2003
- The monadic second order logic of graphs VI: on several representations of graphs by relational structuresDiscrete Applied Mathematics, 1994
- Handle-rewriting hypergraph grammarsJournal of Computer and System Sciences, 1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- The Monadic Theory of OrderAnnals of Mathematics, 1975