The following pages link to On tree-partition-width (Q1024321):
Displaying 15 items.
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← 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)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← 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)
- 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)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
