A classification of polyhedral graph by combinatorially rigid vertices
Metric Geometry
2017-03-16 v2 Combinatorics
Abstract
When the number of non-triangular faces adjacent to a vertex is less than or equal to three, the vertex will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a classification of polyhedra.
Keywords
Cite
@article{arxiv.1610.06425,
title = {A classification of polyhedral graph by combinatorially rigid vertices},
author = {Seonhwa Kim and Yunhi Cho},
journal= {arXiv preprint arXiv:1610.06425},
year = {2017}
}