Pages that link to "Item:Q3971676"
From MaRDI portal
The following pages link to A Separator Theorem for Nonplanar Graphs (Q3971676):
Displaying 50 items.
- Packing minor-closed families of graphs into complete graphs (Q273186) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Packing minor closed families of graphs (Q322346) (← links)
- Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time (Q359743) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- On the Ramsey number of the triangle and the cube (Q519971) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Single source shortest paths in \(H\)-minor free graphs (Q986535) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Singularities, expanders and topology of maps. I: Homology versus volume in the spaces of cycles (Q1047127) (← links)
- Bulky subgraphs of the hypercube (Q1568786) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- On the separation profile of infinite graphs (Q1932130) (← links)
- The size and depth of layered Boolean circuits (Q1944075) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Disjoint complete minors and bipartite minors (Q2372437) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Almost exact matchings (Q2429356) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- On the Fiedler value of large planar graphs (Q2435468) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- (Q2857328) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings (Q3161084) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Graph coloring with no large monochromatic components (Q3503460) (← links)
- A Separator Theorem for String Graphs and Its Applications (Q3605480) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- On the Block Number of Graphs (Q4623134) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- (Q5009574) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Complete Minors in Graphs Without Sparse Cuts (Q5068162) (← links)
