Domino Treewidth
From MaRDI portal
Recommendations
Cited in
(22)- On tree-partition-width
- A partial k-arboretum of graphs with bounded treewidth
- Algorithms for graphs with small octopus
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
- scientific article; zbMATH DE number 1375581 (Why is no real title available?)
- On the model-checking of monadic second-order formulas with edge set quantifications
- Orthogonal tree decompositions of graphs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Domino treewidth
- Dominoes
- Product structure of graph classes with bounded treewidth
- Tree-partitions with bounded degree trees
- Product structure of graph classes with bounded treewidth
- Twin-width of graphs with tree-structured decompositions
- Offensive alliances in signed graphs
- Product structure of graph classes with strongly sublinear separators
- On the parameterized complexity of computing tree-partitions
- Defensive alliances in signed networks
- On the parameterized complexity of computing tree-partitions
- Logical aspects of Cayley-graphs: the group case
- Online promise problems with online width metrics
This page was built for publication: Domino Treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349700)