The following pages link to (Q3128907):
Displaying 36 items.
- Small complete minors above the extremal edge density (Q313429) (← links)
- Short proofs of some extremal results. II. (Q326811) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- New graph decompositions with applications to emulations (Q675853) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem (Q927195) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- Efficient out-of-core algorithms for linear relaxation using blocking covers (Q1356889) (← links)
- Combinatorial aspects of geometric graphs (Q1384214) (← links)
- Polynomial expansion and sublinear separators (Q1686248) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Harmless sets in sparse classes (Q2169963) (← links)
- A note on sublinear separators and expansion (Q2225455) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- 1-subdivisions, the fractional chromatic number and the Hall ratio (Q2663411) (← links)
- Counting Homomorphisms to Sparse Graphs (Q2851494) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Sublinear Separators in Intersection Graphs of Convex Shapes (Q4992837) (← links)
- Well-mixing vertices and almost expanders (Q5039232) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- Complete Minors in Graphs Without Sparse Cuts (Q5068162) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Short and Simple Cycle Separators in Planar Graphs (Q5266605) (← links)
- The order of the largest complete minor in a random graph (Q5900071) (← links)
- Characterising graphs with no subdivision of a wheel of bounded diameter (Q6038576) (← links)
- On weighted sublinear separators (Q6081561) (← links)
- Non-existence of annular separators in geometric graphs (Q6151030) (← links)
