Amalgam Width of Matroids
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 268-280
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Decomposition width of matroidsDiscrete Applied Mathematics, 2012
- Monadic second-order model-checking on decomposable matroidsDiscrete Applied Mathematics, 2011
- Testing branch-widthJournal of Combinatorial Theory, Series B, 2007
- Matroid tree-widthEuropean Journal of Combinatorics, 2006
- Approximating clique-width and branch-widthJournal of Combinatorial Theory, Series B, 2006
- Branch-width, parse trees, and monadic second-order logic for matroidsJournal of Combinatorial Theory, Series B, 2006
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logicDiscrete Applied Mathematics, 2001
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- Graph minors. X. Obstructions to tree-decompositionJournal of Combinatorial Theory, Series B, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990