The following pages link to Excluded Grid Theorem (Q2941560):
Displaying 19 items.
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
