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 (combinatorially) rigid. We study the number of rigid vertices and suggest a conjecture on a classification of polyhedra.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.