The following pages link to Quickly excluding a planar graph (Q1338321):
Displaying 50 items.
- Minimizing the oriented diameter of a planar graph (Q2851475) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Minors in large almost-5-connected non-planar graphs (Q2911058) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- Strengthening Erdös-Pósa property for minor-closed graph classes (Q3083410) (← links)
- Planar Digraphs (Q3120437) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Even-hole-free planar graphs have bounded treewidth (Q3503541) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- On the Block Number of Graphs (Q4623134) (← links)
- The size of an intertwine (Q4632453) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs (Q4933601) (← links)
- (Q4972036) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- Erdös--Pósa Property for Labeled Minors: 2-Connected Minors (Q4990390) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q5075819) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- (Q5116530) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
- Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
- (Q5743428) (← links)
- (Q5743487) (← links)
- (Q5743499) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Some arithmetical restatements of the four color conjecture (Q5941259) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Packing cycles in undirected group-labelled graphs (Q6038589) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
