Vertex-minors, monadic second-order logic, and a conjecture by Seese
Authors:
- 1 January 2007
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 97 (1) , 91-126
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- The monadic second-order logic of graphs XV: On a conjecture by D. SeeseJournal of Applied Logic, 2006
- Clique-width of countable graphs: a compactness propertyDiscrete Mathematics, 2004
- Edge dominating set and colorings on graphs with fixed clique-widthDiscrete Applied Mathematics, 2003
- The monadic second-order logic of graphs X: Linear orderingsTheoretical Computer Science, 1996
- A logical characterization of the sets of hypergraphs defined by Hyperedge Replacement grammarsTheory of Computing Systems, 1995
- k-NLC graphs and polynomial algorithmsDiscrete Applied Mathematics, 1994
- Transforming trees by successive local complementationsJournal of Graph Theory, 1988
- Isotropic SystemsEuropean Journal of Combinatorics, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968