The following pages link to On tree-partition-width (Q1024321):
Displaying 30 items.
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Partitioning graphs of bounded tree-width (Q1307308) (← links)
- On tree-partitions of graphs (Q1910567) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Treewidth of grid subsets (Q2416442) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← links)
- Vertex partitions of chordal graphs (Q3419709) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- The size‐Ramsey number of powers of bounded degree trees (Q5006327) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Losing Treewidth by Separating Subsets (Q5236288) (← links)
- The Size Ramsey Number of Graphs with Bounded Treewidth (Q5854459) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Bounded-degree planar graphs do not have bounded-degree product structure (Q6574390) (← links)
- Colouring strong products (Q6612523) (← links)
- Product structure of graph classes with bounded treewidth (Q6630446) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)
