A classification of polyhedral graph by combinatorially rigid vertices

Seonhwa Kim, Yunhi Cho

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 n…