The following pages link to Quickly excluding a planar graph (Q1338321):
Displaying 50 items.
- Highly connected sets and the excluded grid theorem (Q1306423) (← links)
- The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Graph minors. XVI: Excluding a non-planar graph (Q1410731) (← links)
- Triangle-free planar graphs with small independence number (Q1633607) (← links)
- Excluding a full grid minor (Q1688263) (← links)
- Untangling planar curves (Q1688858) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- On tree-partitions of graphs (Q1910567) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Packing and covering immersions in 4-edge-connected graphs (Q1984514) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- An improved planar graph product structure theorem (Q2152790) (← links)
- Characterising \(k\)-connected sets in infinite graphs (Q2171028) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Tree-width and planar minors (Q2259855) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Treewidth of graphs with balanced separations (Q2312607) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- Packing \(A\)-paths of length zero modulo a prime (Q2692782) (← links)
- Quickly excluding \(K_{2,r}\) from planar graphs (Q2741369) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- On planar graphs with large tree-width and small grid minors (Q2839208) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
