The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
Open Access
- 1 January 1992
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 26 (3) , 257-286
- https://doi.org/10.1051/ita/1992260302571
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 29 references indexed in Scilit:
- An algebraic theory of graph reductionPublished by Springer Nature ,2005
- Recognizing edge replacement graph languages in cubic timePublished by Springer Nature ,2005
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Infinite hypergraphs I. Basic propertiesTheoretical Computer Science, 1991
- Forbidden minors characterization of partial 3-treesDiscrete Mathematics, 1990
- Dynamic programming on graphs with bounded treewidthPublished by Springer Nature ,1988
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesPublished by Springer Nature ,1988
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986