A classification of polyhedral graph by combinatorially rigid vertices
classification
🧮 math.MG
math.CO
keywords
rigidclassificationcombinatoriallyemphnumbervertexverticesadjacent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.