arXiv · 1610.06425
A classification of polyhedral graph by combinatorially rigid vertices
Abstract
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a classification of polyhedra.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Seonhwa Kim, Yunhi Cho. 2017-03-15. A classification of polyhedral graph by combinatorially rigid vertices. https://arxiv.org/abs/1610.06425
Cite the original work for its findings. Save a collection to share your selection of sources.