Bipartite Rigidity
From MaRDI portal
Publication:3466829
DOI10.1007/978-3-319-20155-9_20zbMath1329.05087OpenAlexW4240678009MaRDI QIDQ3466829
Publication date: 25 January 2016
Published in: Springer INdAM Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20155-9_20
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigidity and the lower bound theorem. I
- Obstructions to the imbedding of a complex in a euclidean space. I: The first obstruction
- Bipartite minors
- On embeddability and stresses of graphs
- Hyperconnectivity of graphs
- A matroid on hypergraphs, with applications in scene analysis and geometry
- The rigidity of graphs. II
- The lower and upper bound problems for cubical polytopes
- Gaps in the numbers of vertices of cubical polytopes. I
- Van Kampen's embedding obstruction is incomplete for 2-complexes in \(\mathbb{R}^ 4\)
- P.L.-spheres, convex polytopes, and stress
- Counting faces of cubical spheres modulo two
- Face numbers and nongeneric initial ideals
- Über eine Eigenschaft der ebenen Komplexe
- The Rigidity of Graphs
- Approximating Embeddings of Polyhedra In Codimension Three
This page was built for publication: Bipartite Rigidity
