The following pages link to Quickly excluding a planar graph (Q1338321):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- On the treewidth of toroidal grids (Q897618) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- A bound on the treewidth of planar even-hole-free graphs (Q987668) (← links)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Graph minors. XXI. graphs with unique linkages (Q1026001) (← links)
- Tangles, tree-decompositions and grids in matroids (Q1026005) (← links)
- Graph minors. X: Obstructions to tree-decomposition (Q1179473) (← links)
- Excluding infinite minors (Q1191928) (← links)
- Upper bounds on the size of obstructions and intertwines (Q1272647) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Minor-equivalence for infinite graphs (Q1296983) (← links)
- 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)
