On embeddability and stresses of graphs
From MaRDI portal
Publication:950325
DOI10.1007/s00493-007-2168-xzbMath1157.05331arXivmath/0411009OpenAlexW2016748008MaRDI QIDQ950325
Publication date: 22 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0411009
Related Items (10)
Bipartite Rigidity ⋮ On the embeddability of skeleta of spheres ⋮ Detecting minors in matroids through triangles ⋮ Maximum likelihood threshold and generic completion rank of graphs ⋮ On embeddability and stresses of graphs ⋮ The extremal function and Colin de Verdière graph parameter ⋮ The Colin de Verdière parameter, excluded minors, and the spectral radius ⋮ Generic initial ideals and fibre products ⋮ Bipartite rigidity ⋮ The Lefschetz property for barycentric subdivisions of shellable complexes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigidity and the lower bound theorem. I
- On embeddability and stresses of graphs
- The rigidity of graphs. II
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Homomorphiesätze für Graphen
- The extremal function for \(K_{8}^{-}\) minors
- The Rigidity of Graphs
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- Linkless embeddings of graphs in 3-space
This page was built for publication: On embeddability and stresses of graphs
