A classification of polyhedral graph by combinatorially rigid vertices

2016/10/18 by Kim, Seonhwa, Cho, Yunhi
#05C10 #52B10 #52C25 #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.1610.06425

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.

Related

• Classification of polyhedral graphs by numbers of common neighbours
• Combinatorially rigid simple polytopes with d+3 facets
• Rigidity of nonconvex polyhedra with respect to edge lengths and dihedral angles
• Block-and-hole graphs: Constructibility and (3,0)-sparsity
• The rigidity of infinite graphs