The following pages link to (Q4273838):
Displaying 27 items.
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Apex graphs with embeddings of face-width three (Q1377691) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- On the invariance of Colin de Verdière's graph parameter under clique sums (Q1899429) (← links)
- The Colin de Verdière parameter, excluded minors, and the spectral radius (Q2000642) (← links)
- Non-separating planar graphs (Q2223464) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
- Linearly embedded graphs in 3-space with homotopically free exteriors (Q2346735) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Primitive spatial graphs and graph minors (Q2471413) (← links)
- Graphs and obstructions in four dimensions. (Q2490839) (← links)
- Knots and links in spatial graphs: a survey (Q2575796) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- On Euclidean distances and sphere representations (Q2698540) (← links)
- Face-width of embedded graphs (Q2702745) (← links)
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs (Q4383122) (← links)
- Knot graphs (Q4487078) (← links)
- A user's guide to the topological Tverberg conjecture (Q4684242) (← links)
- Multiplicités des valeurs propres et transformations étoile-triangle des graphes (Q4869991) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Linkless and flat embeddings in 3-space and the unknot problem (Q5405867) (← links)
- New bounds on maximal linkless graphs (Q6148480) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- Improved bounds on the cop number when forbidding a minor (Q6667593) (← links)
